Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 68
Volume 68, Number 1, September 2011
- Daniel Horsley
:
Maximum packings of the complete graph with uniform length cycles. 1-7 - J. M. McDonald:
On a theorem of Goldberg. 8-21 - Darryn E. Bryant, Peter Danziger:
On bipartite 2-factorizations of kn - I and the Oberwolfach problem. 22-37 - Frédéric Gardi:
On partitioning interval graphs into proper interval subgraphs and related problems. 38-54 - Guantao Chen, Zhiquan Hu, Yaping Wu:
Circumferences of k-connected graphs involving independence numbers. 55-76 - Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito:
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. 77-89
Volume 68, Number 2, October 2011
- Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster:
On graphs and algebraic graphs that do not contain cycles of length 4. 91-102 - Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Characterizing directed path graphs by forbidden asteroids. 103-112 - Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the complexity of reconstructing H-free graphs from their Star Systems. 113-124 - Giuseppe Mazzuoccolo:
The equivalence of two conjectures of Berge and Fulkerson. 125-128 - Tom Rackham:
The number of defective colorings of graphs on surfaces. 129-136 - Terry A. McKee:
When every k-cycle has at least f(k) chords. 137-147 - Rong Luo, Yue Zhao:
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5. 148-168 - Oleg V. Borodin, Anna O. Ivanova:
Acyclic 5-choosability of planar graphs without adjacent short cycles. 169-176
Volume 68, Number 3, November 2011
- Letícia Rodrigues Bueno, Peter Horák:
On hamiltonian cycles in the prism over the odd graphs. 177-188 - Robert Lukot'ka, Martin Skoviera:
Snarks with given real flow numbers. 189-201 - Rong Luo, Yue Zhao:
A new upper bound for the independence number of edge chromatic critical graphs. 202-212 - Yusuke Suzuki:
Re-embedding structures of 4-connected projective-planar graphs. 213-228 - Marcin Kaminski, Paul Medvedev, Martin Milanic:
The plane-width of graphs. 229-245 - Ákos Seress, Eric Swartz:
A note on the girth-doubling construction for polygonal graphs. 246-254 - Andrzej Dudek, Reshma Ramadurai:
Vertex colorings of graphs without short odd cycles. 255-264
Volume 68, Number 4, December 2011
- Eyal Loz, Martin Macaj, Mirka Miller, Jana Siagiová, Jozef Sirán, Jana Tomanová:
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach. 265-284 - Mingchu Li, Xiaodong Chen, Hajo Broersma:
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. 285-298 - Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald:
Disjoint Hamilton cycles in the random geometric graph. 299-322 - Gerard J. Chang:
Near-automorphisms of paths. 323-325 - Elad Horev:
Extremal graphs without a semi-topological wheel. 326-339 - Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. 340-348
a service of 
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 2024-04-25 05:29 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
