Result 1 to 20 of 205 total
Total embedding distributions of Ringel ladders. (English)
Discrete Math. 311, No. 21, 2463-2474 (2011).
1
Planar $α$-overlap graphs. (English)
Congr. Numerantium 210, 57-59 (2011).
2
Genus polynomials of cycles with double edges. (English)
Acta Math. Sin., Engl. Ser. 27, No. 3, 595-606 (2011).
3
Graphs \& digraphs. 5th ed. (English)
Boca Raton, FL: CRC Press (ISBN 978-1-4398-2627-0/hbk). xii, 586~p. \$~89.95 (2011).
4
Introductory map theory. (English)
Glendale, AZ: Kappa \& Omega (ISBN 978-1-59973-134-6/pbk). xv, 487~p. (2010).
5
Genus distribution of graphs under surgery: adding edges and splitting vertices. (English)
New York J. Math. 16, 161-178 (2010).
6
On the Kontsevich integral for knotted trivalent graphs. (English)
Algebr. Geom. Topol. 10, No. 3, 1317-1365 (2010).
7
Continuous $k$-to-$1$ functions between complete graphs of even order. (English)
Discrete Math. 310, No. 2, 330-346 (2010).
8
Topological graph dimension. (English)
Discrete Math. 310, No. 2, 325-329 (2010).
9
New bijective links on planar maps via orientations. (English)
Eur. J. Comb. 31, No. 1, 145-160 (2010).
10
Cycle factorizations and 1-faced graph embeddings. (English)
Eur. J. Comb. 31, No. 1, 129-144 (2010).
11
2-distance $(\varDelta +2)$-coloring of planar graphs with girth six and $\varDelta \geq 18$. (English)
Discrete Math. 309, No. 23-24, 6496-6502 (2009).
12
Upper embeddability, girth and the degree-sum of nonadjacent vertices. (English)
Graphs Comb. 25, No. 2, 253-264 (2009).
13
Bounding the size of equimatchable graphs of fixed genus. (English)
Graphs Comb. 25, No. 1, 91-99 (2009).
14
Polychromatic colorings of rectangular partitions. (English)
Discrete Math. 309, No. 9, 2957-2960 (2009).
15
Matching theory. Reprint of the 1986 original published by North-Holland. (English)
Providence, RI: AMS Chelsea Publishing (ISBN 978-0-8218-4759-6/hbk). xxxiii, 547~p. (2009).
16
Decomposing a planar graph of girth 5 into an independent set and a forest. (English)
J. Comb. Theory, Ser. B 99, No. 4, 674-684 (2009).
17
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. (English)
J. Comb. Theory, Ser. B 99, No. 4, 668-673 (2009).
18
Chirality groups of maps and hypermaps. (English)
J. Algebr. Comb. 29, No. 3, 337-355 (2009).
19
Skewness and crossing numbers of graphs. (English)
Bull. Inst. Comb. Appl. 55, 17-32 (2009).
20
Result 1 to 20 of 205 total
Start
Contact
Print
General Help
