default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 97
Volume 97, Number 1, May 2021
- Jakub Przybylo
, Jakub Kwasny:
On the inclusion chromatic index of a graph. 5-20 - Tereza Klimosová, Stéphan Thomassé:
Edge-decomposing graphs into coprime forests. 21-33 - Maria Axenovich, Casey Tompkins, Lea Weber:
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs. 34-46 - Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. 47-69 - Yan-Li Qin, Binzhou Xia, Sanming Zhou:
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs. 70-81 - Andrew Vince:
The average size of a connected vertex set of a graph - Explicit formulas and open problems. 82-103 - Stijn Cambie:
Extremal total distance of graphs of given radius I. 104-122 - Yair Caro, Adriana Hansberg, Amanda Montejano:
Unavoidable chromatic patterns in 2-colorings of the complete graph. 123-147 - Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Single-conflict colouring. 148-160 - Fábio Botler, Maycon Sambinelli:
Towards Gallai's path decomposition conjecture. 161-184
Volume 97, Number 2, June 2021
- Xing Feng, Fuliang Lu:
On extremal nonsolid bricks. 189-193 - Ruixia Wang:
Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs. 194-207 - Roman Glebov, Zur Luria, Michael Simkin:
Perfect matchings in random subgraphs of regular bipartite graphs. 208-231 - Anastasia Halfpap, Cory Palmer:
On supersaturation and stability for generalized Turán problems. 232-240 - Tomás Kaiser, Petr Vrána:
The Hamiltonicity of essentially 9-connected line graphs. 241-259 - Saieed Akbari, Daniel Horsley, Ian M. Wanless:
Induced path factors of regular graphs. 260-280 - Timothy Sun:
Face distributions of embeddings of complete graphs. 281-304 - Shenwei Huang, T. Karthick:
On graphs with no induced five-vertex path or paraglider. 305-323 - Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati:
Edge clique covers in graphs with independence number two. 324-339 - Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, Ben Lund:
Perfect matchings and derangements on graphs. 340-354
Volume 97, Number 3, July 2021
- Maria Chudnovsky, Cemil Dibek:
Strongly perfect claw-free graphs - A short proof. 359-381 - Frantisek Kardos, Martina Mockovciaková:
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles. 382-392 - Farid Bouya, Bogdan Oporowski:
Seymour's second-neighborhood conjecture from a different perspective. 393-400 - Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastián González Hermosillo de la Maza:
Meyniel's conjecture on graphs of bounded degree. 401-407 - Jürgen Jost, Raffaella Mulas:
Cheeger-like inequalities for the largest eigenvalue of the graph Laplace operator. 408-425 - Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar, Matthew Sullivan:
Drawings of complete graphs in the projective plane. 426-440 - Huiqiu Lin, Bo Ning:
A complete solution to the Cvetković-Rowlinson conjecture. 441-450 - Kathie Cameron, Shenwei Huang, Owen D. Merkel:
An optimal χ -bound for ( P 6 , diamond)-free graphs. 451-465
- Przemyslaw Gordinowicz:
Erratum: The 2-surviving rate of planar graphs with average degree lower than 9 2. 466-469
Volume 97, Number 4, July 2021
- Ni Luh Dewi Sintiari, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs - Part 1: Layered wheels. 475-509 - Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected search for a lazy robber. 510-552 - Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. 553-556 - Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. 557-568 - Daiki Ikegami, Shun-ichi Maezawa, Carol T. Zamfirescu:
On 3-polytopes with non-Hamiltonian prisms. 569-577 - Jan Hladký, Christos Pelekis, Matas Sileikis:
A limit theorem for small cliques in inhomogeneous random graphs. 578-599 - Jan Corsten, Tuan Tran:
Balanced supersaturation for some degenerate hypergraphs. 600-623 - Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2: Bounds on treewidth. 624-641 - Binlong Li, Bo Ning:
Exact bipartite Turán numbers of large even cycles. 642-656 - Matt DeVos, Mahdieh Malekian:
The structure of graphs with no W4 immersion. 657-679
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 2025-05-25 17:04 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:
