default search action
Journal of Graph Theory, Volume 88
Volume 88, Number 1, May 2018
- Peter Dankelmann, Yubao Guo, Michel Surmacs:
Oriented diameter of graphs with given maximum degree. 5-17 - Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. 18-39 - Jan Goedgebeur, Carol T. Zamfirescu:
Infinitely many planar cubic hypohamiltonian graphs of girth 5. 40-45 - Rongxia Hao, Cun-Quan Zhang, Ting Zheng:
Berge-Fulkerson coloring for C(8)-linked graphs. 46-60 - Alexander M. Stephens, Ortrud R. Oellermann:
The mean order of sub-k-trees of k-trees. 61-79 - Yichao Chen, Jonathan L. Gross:
An Euler-genus approach to the calculation of the crosscap-number polynomial. 80-100 - János Barát, Géza Tóth:
Improvements on the density of maximal 1-planar graphs. 101-109 - Daniel P. Biebighauser, Mark N. Ellingham:
One-way infinite 2-walks in planar graphs. 110-130 - Michael Gentner, Michael A. Henning, Dieter Rautenbach:
Smallest domination number and largest independence number of graphs and forests with given degree sequence. 131-145 - Jens M. Schmidt:
Tight bounds for the vertices of degree k in minimally k-connected graphs. 146-153 - Boris Albar, Daniel Gonçalves:
On triangles in -minor free graphs. 154-173 - Wayne Goddard, Michael A. Henning:
Thoroughly dispersed colorings. 174-191 - Leonardo Nagami Coregliano:
Quasi-carousel tournaments. 192-210 - Zdenek Dvorák, Liana Yepremyan:
Complete graph immersions and minimum degree. 211-221 - Attila Joó:
Gomory-Hu trees of infinite graphs with finite total weight. 222-231
Volume 88, Number 2, June 2018
- Ziwen Huang, Xiangwen Li, Gexin Yu:
A relaxation of the strong Bordeaux Conjecture. 237-254 - M. Malliaris, Caroline Terry:
On unavoidable-induced subgraphs in large prime graphs. 255-270 - Bart Litjens, Bart Sevenster:
Partition functions and a generalized coloring-flow duality for embedded graphs. 271-283 - Hongliang Lu, Xingxing Yu, Li Zhang:
Disjoint perfect matchings in 3-uniform hypergraphs. 284-293 - Helin Gong, Xian'an Jin:
A simple formula for the number of spanning trees of line graphs. 294-301 - Maximilien Gadouleau:
On the possible values of the entropy of undirected graphs. 302-311 - Nicolas Trotignon, Lan Anh Pham:
χ-bounds, operations, and chords. 312-336 - Meysam Alishahi, Hossein Hajiabolhassan:
A generalization of Gale's lemma. 337-346 - Martin Rolek, Zi-Xia Song:
Clique minors in double-critical graphs. 347-355 - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Dominating sets inducing large components in maximal outerplanar graphs. 356-370
Volume 88, Number 3, July 2018
- Shude Long, Han Ren:
The decycling number and maximum genus of cubic graphs. 375-384 - Gexin Yu:
Covering 2-connected 3-regular graphs with disjoint paths. 385-401 - János Körner, Angelo Monti:
Families of locally separated Hamilton paths. 402-410 - Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte:
Full subgraphs. 411-427 - Noga Alon, Michael Krivelevich:
Clique coloring of dense random graphs. 428-433 - Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Bridget S. Webb:
On Hamilton decompositions of infinite circulant graphs. 434-448 - Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. 449-481 - Matthias Mnich, Eva-Lotta Teutrine:
Improved bounds for minimal feedback vertex sets in tournaments. 482-506 - Ramin Javadi, Afsaneh Khodadadpour, Gholam Reza Omidi:
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. 507-520 - Anton Bernshteyn, Alexandr V. Kostochka:
Sharp Dirac's theorem for DP-critical graphs. 521-546
Volume 88, Number 4, August 2018
- Carol T. Zamfirescu, Tudor I. Zamfirescu:
Every graph occurs as an induced subgraph of some hypohamiltonian graph. 551-557 - Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck:
Multigraphs without large bonds are wqo by contraction. 558-565 - Hui Lei, Yongtang Shi, Zi-Xia Song:
Star chromatic index of subcubic multigraphs. 566-576 - Miaomiao Han, Hong-Jian Lai, Jiaao Li:
Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees. 577-591 - Ringi Kim, Seog-Jin Kim, Jie Ma, Boram Park:
Cycles with two blocks in k-chromatic digraphs. 592-605 - Dániel T. Soukup:
Orientations of graphs with uncountable chromatic number. 606-630 - Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki:
Decomposing planar cubic graphs. 631-640
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.