Result 1 to 20 of 349 total
Combinatorial reciprocity theorems. (English)
Jahresber. Dtsch. Math.-Ver. 114, No. 1, 3-22 (2012).
1
On zero forcing number of permutation graphs. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 61-72 (2012).
2
Bipartite permutation graphs are reconstructible. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250039,14p. (2012).
3
Permutation labeling of graphs. (English)
J. Comb. Math. Comb. Comput. 81, 135-143 (2012).
4
Edge-connectivity of permutation hypergraphs. (English)
Discrete Math. 312, No. 17, 2536-2539 (2012).
5
Monomial graphs and generalized quadrangles. (English)
Finite Fields Appl. 18, No. 4, 674-684 (2012).
6
Symmetry in mathematical programming. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 263-283 (2012).
7
On Lee’s conjecture. (English)
Util. Math. 87, 305-329 (2012).
8
Distinguishability of infinite groups and graphs. (English)
Electron. J. Comb. 19, No. 2, Research Paper P27, 10 p., electronic only (2012).
9
Sparse matrix decompositions and graph characterizations. (English)
Linear Algebra Appl. 437, No. 3, 932-947 (2012).
10
Random generation and enumeration of bipartite permutation graphs. (English)
J. Discrete Algorithms 10, 84-97 (2012).
11
Random induced subgraphs of Cayley graphs induced by transpositions. (English)
Discrete Math. 311, No. 21, 2496-2511 (2011).
12
Codes and designs from triangular graphs and their line graphs. (English)
Cent. Eur. J. Math. 9, No. 6, 1411-1423 (2011).
13
On automorphisms of Cayley graphs, and irregular groups. (English)
Australas. J. Comb. 51, 157-173 (2011).
14
Tenacity and rupture degree of permutation graphs of complete bipartite graphs. (English)
Bull. Malays. Math. Sci. Soc. (2) 34, No. 3, 423-434 (2011).
15
Nonorientable regular embeddings of graphs of order $pq$. (English)
Sci. China, Math. 54, No. 2, 351-363 (2011).
16
Functigraphs: an extension of permutation graphs. (English)
Math. Bohem. 136, No. 1, 27-37 (2011).
17
Base size, metric dimension and other invariants of groups and graphs. (English)
Bull. Lond. Math. Soc. 43, No. 2, 209-242 (2011).
18
The graphical complexity of direct products of permutation groups. (English)
J. Graph Theory 66, No. 4, 303-318 (2011).
19
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. (English)
Theor. Comput. Sci. 412, No. 12-14, 1275-1297 (2011).
20
Result 1 to 20 of 349 total
Start
Contact
Print
General Help
