default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 52
Volume 52, Number 1, May 2006
- Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
Domination in a graph with a 2-factor. 1-6 - Angelika Hellwig, Lutz Volkmann:
On connectivity in graphs with given clique number. 7-14 - Svetlana Drajnová, Jaroslav Ivanco, Andrea Semanicová
:
Numbers of edges in supermagic graphs. 15-26 - Dean Hoffman, Heather Jordon:
Signed graph factors and degree sequences. 27-36 - Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Roots of cube polynomials of median graphs. 37-50 - Hong-Jian Lai, Xiangwen Li:
Group chromatic number of planar graphs of girth at least 4. 51-72 - Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Sufficient conditions for lambda'-optimality in graphs with girth g. 73-86
Volume 52, Number 2, June 2006
- Béla Bollobás, Graham R. Brightwell:
How many graphs are unions of k-cliques? 87-107 - Bart De Bruyn:
Bounding the size of near hexagons with lines of size 3. 108-122 - Nurit Gazit, Michael Krivelevich:
On the asymptotic value of the choice number of complete multi-partite graphs. 123-134 - János Barát, Carsten Thomassen:
Claw-decompositions and tutte-orientations. 135-146 - Gábor N. Sárközy, Stanley M. Selkow:
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. 147-156 - Vladimir Nikiforov, Richard H. Schelp:
Cycle lengths in graphs with large minimum degree. 157-170 - Martin Knor, Ludovít Niepel:
Iterated line graphs are maximally ordered. 171-180
Volume 52, Number 3, July 2006
- Frédéric Havet, Jean-Sébastien Sereni:
Improper choosability of graphs and maximum average degree. 181-199 - T. H. Marshall:
Antisymmetric flows on planar graphs. 200-210 - Dhruv Mubayi, Vera T. Sós:
Explicit constructions of triple systems for Ramsey-Turán problems. 211-216 - Tibor Jordán:
A characterization of weakly four-connected graphs. 217-229 - Alex R. Berg, Tibor Jordán:
Two-connected orientations of Eulerian graphs. 230-242 - Gek Ling Chia, Poh-Hwa Ong:
Isomorphic factorization of the complete graph into Cayley digraphs. 243-256 - Carsten Thomassen:
Rectangular and visibility representations of infinite planar graphs. 257-265
Volume 52, Number 4, August 2006
- David Hartvigsen, Pavol Hell, Jácint Szabó:
The k-piece packing problem. 267-293 - Arnaud Pêcher, Xuding Zhu:
On the circular chromatic number of circular partitionable graphs. 294-306 - Edita Mácajová, André Raspaud:
On the strong circular 5-flow conjecture. 307-316 - Martin Charles Golumbic, Robert E. Jamison:
Rank-tolerance graph classes. 317-340 - Yan-Quan Feng, Jin Ho Kwak, Ming Yao Xu:
Cubic s-regular graphs of order 2p3. 341-352 - Boris Bukh:
Maximum pebbling number of graphs of diameter three. 353-357
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-11 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
