default search action
Journal of Graph Theory, Volume 95
Volume 95, Number 1, September 2020
- Aistis Atminas, Robert Brignall:
Well-quasi-ordering and finite distinguishing number. 5-26 - Jackson Autry, Christopher O'Neill:
Sequentially embeddable graphs. 27-33 - Jie Han, Chuanyun Zang, Yi Zhao:
Matchings in k-partite k-uniform hypergraphs. 34-58 - Alexander Roberts:
Tree matchings. 59-75 - Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
On DP-coloring of digraphs. 76-98 - Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih:
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. 99-124 - Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu:
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. 125-137 - Michael Tarsi:
Bounded-excess flows in cubic graphs. 138-159
Volume 95, Number 2, October 2020
- Jessica McDonald, Gregory J. Puleo:
t-Cores for (Δ+t) -edge-coloring. 165-180 - Attila Dankovics:
Low independence number and Hamiltonicity implies pancyclicity. 181-191 - Xiao Zhao, Fengming Dong, Sheng Chen:
On nonfeasible edge sets in matching-covered graphs. 192-208 - Benjamin Espinoza, Paul Gartside, Max Pitz:
Graph-like compacta: Characterizations and Eulerian loops. 209-239 - Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. 240-255 - Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper orientation number of triangle-free bridgeless outerplanar graphs. 256-266 - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. 267-289 - Gord Simons, Claude Tardif, David L. Wehlau:
Topologically 4-chromatic graphs and signatures of odd cycles. 290-307
Volume 95, Number 3, November 2020
In Memoriam
- In Memoriam Robin Thomas. 313
- Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. 315-340 - Jun Fujisawa, Hiroki Seno:
Edge proximity and matching extension in projective planar graphs. 341-367 - Zhidan Luo, Yuejian Peng:
Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles. 368-383 - Wei Wang, Jianguo Qian, Zhidan Yan:
Colorings versus list colorings of uniform hypergraphs. 384-397 - Maria Axenovich, Izolda Gorgol:
On induced Ramsey numbers for multiple copies of graphs. 398-409 - Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Edge precoloring extension of hypercubes. 410-444 - Daniel J. Harvey, Gordon F. Royle:
Chromatic roots at 2 and the Beraha number B10. 445-456 - Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. 457-466 - Bojan Mohar, Hehui Wu:
Fractional chromatic number of a random subgraph. 467-472 - Alex Scott, Paul D. Seymour:
A survey of χ-boundedness. 473-504
Volume 95, Number 4, December 2020
- Qinghai Liu, Qing Cui, Xing Feng, Fuliang Lu:
A characterization of nonfeasible sets in matching covered graphs. 509-526 - Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. 527-542 - Ademir Hujdurovic:
Strong cliques in vertex-transitive graphs. 543-564 - Martín Matamala, José Zamora:
Lines in bipartite graphs and in 2-metric spaces. 565-585 - Long Wang, Xianya Geng:
Proof of a conjecture on the nullity of a graph. 586-593 - Nishad Kothari, Marcelo Henriques de Carvalho:
Generating simple near-bipartite bricks. 594-637 - Rongxing Xu, Xuding Zhu:
Multiple list coloring of 3-choice critical graphs. 638-654 - József Balogh, Sárka Petrícková, Adam Zsolt Wagner:
Families in posets minimizing the number of comparable pairs. 655-676 - Jia-Li Du, Yan-Quan Feng, Pablo Spiga:
On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups. 677-701
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.