default search action
Journal of Graph Theory, Volume 79
Volume 79, Number 1, May 2015
- Eckhard Steffen:
Edge Colorings and Circular Flow Numbers of Regular Graphs. 1-7 - Jørgen Bang-Jensen, Alessandro Maddaloni:
Sufficient Conditions for a Digraph to be Supereulerian. 8-20 - Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs. 21-29 - André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Finding Minors in Graphs with a Given Path Structure. 30-47 - Daniel J. Harvey, David R. Wood:
Treewidth of the Line Graph of a Complete Graph. 48-54 - Ruixia Wang, Wei Meng:
k-Kings in k-Quasitransitive Digraphs. 55-62 - Carol T. Zamfirescu:
On Hypohamiltonian and Almost Hypohamiltonian Graphs. 63-81
Volume 79, Number 2, June 2015
- Michitaka Furuya, Naoki Matsumoto:
A Note on the Domination Number of Triangulations. 83-85 - Jonathan A. Noel, Bruce A. Reed, Hehui Wu:
A Proof of a Conjecture of Ohba. 86-102 - John Engbers:
Extremal H-Colorings of Graphs with Fixed Minimum Degree. 103-124 - Tamás Makai:
The Reverse H-free Process for Strictly 2-Balanced Graphs. 125-144 - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Maximum Order of Triangle-Free Graphs with a Given Rank. 145-158 - Robin Christian, R. Bruce Richter, Gelasio Salazar:
Embedding a Graph-Like Continuum in Some Surface. 159-165
Volume 79, Number 3, July 2015
- Darryn E. Bryant, Nicholas J. Cavenagh:
Decomposing Graphs of High Minimum Degree into 4-Cycles. 167-177 - Reza Naserasr, Edita Rollová, Éric Sopena:
Homomorphisms of Signed Graphs. 178-212 - Yoshimi Egawa, Kenta Ozeki:
Spanning Trees with Vertices Having Large Degrees. 213-221 - Emily Abernethy Marshall, David R. Wood:
Circumference and Pathwidth of Highly Connected Graphs. 222-232 - Peng-An Chen:
On the Multichromatic Number of s-Stable Kneser Graphs. 233-248
Volume 79, Number 4, August 2015
- Jørgen Bang-Jensen, Stéphane Bessy:
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. 249-266 - Felix Joos:
A Characterization of Mixed Unit Interval Graphs. 267-281 - Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. 282-299 - Jie Han, Yi Zhao:
Minimum vertex degree threshold for C43-tiling. 300-317 - Gábor Simonyi, Gábor Tardos, Ambrus Zsbán:
Relations between the Local Chromatic Number and Its Directed Version. 318-330
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.