default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 75
Volume 75, Number 1, January 2014
- Cai Heng Li
, Zai Ping Lu, Gai Xia Wang:
Vertex-Transitive Cubic Graphs of Square-Free Order. 1-19 - Kenta Noguchi:
The Empire Problem in Even Embeddings on Closed Surfaces. 20-30 - Yu-Chang Liang, Xuding Zhu:
Antimagic Labeling of Cubic Graphs. 31-36 - Sanming Zhou:
Unitary Graphs. 37-47 - Hossein Hajiabolhassan, Ali Taherkhani:
On the Circular Chromatic Number of Graph Powers. 48-58 - Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki:
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. 59-74 - Paul Dorbec, Mickaël Montassier, Pascal Ochem:
Vertex Partitions of Graphs into Cographs and Stars. 75-90 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Diameter 2. 91-103
Volume 75, Number 2, February 2014
- Peter Dankelmann, Tomás Vetrík:
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. 105-123 - Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle:
Tiling 3-Uniform Hypergraphs With K43-2e. 124-136 - Martin Knor, Jozef Sirán:
Smallest Vertex-Transitive Graphs of Given Degree and Diameter. 137-149 - Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Linear Balanceable and Subcubic Balanceable Graphs. 150-166 - Herbert Fleischner:
Uniquely Hamiltonian Graphs of Minimum Degree 4. 167-177 - Maria Chudnovsky:
The Erdös-Hajnal Conjecture - A Survey. 178-190 - Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud:
Limits of Near-Coloring of Sparse Graphs. 191-202
Volume 75, Number 3, March 2014
- Maria Chudnovsky, Matthieu Plumettaz:
The Structure of Claw-Free Perfect Graphs. 203-230 - James Hirst:
The Inducibility of Graphs on Four Vertices. 231-243 - Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
On Toughness and Hamiltonicity of 2K2-Free Graphs. 244-255 - Peter Harding, Sean McGuinness:
Gallai's Conjecture For Graphs of Girth at Least Four. 256-274 - Spencer Tofts:
An Extremal Property of Turán Graphs, II. 275-283 - Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé:
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. 284-302
Volume 75, Number 4, April 2014
- Luke Postle:
Pebbling Graphs of Fixed Diameter. 302-310 - Pierre Aboulker:
Excluding 4-Wheels. 311-322 - Moshe Rosenfeld, Nam Lê Tien:
Forbidden Subgraphs of the Odd-Distance Graph. 323-330 - Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell:
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. 331-354 - Jan Florek:
Arc-Disjoint Cycles and Feedback Arc Sets. 355-357 - Zdenek Ryjácek, Petr Vrána:
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs. 358-376 - Alexandr V. Kostochka:
Ks, t Minors in (s+t)- Chromatic Graphs, II. 377-386 - Eva Jelínková, Jan Kratochvíl:
On Switching to H-Free Graphs. 387-405
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-11-06 20:35 CET 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:
