default search action
Journal of Graph Theory, Volume 90
Volume 90, Number 1, January 2019
- Alex Scott
, Paul D. Seymour
Bad news for chordal partitions. 5-12 - Jie Ma
Decomposing C4-free graphs under degree constraints. 13-23 - Jan Hladký
Komlós's tiling theorem via graphon covers. 24-45 - Tong Li, Zi-Xia Song
Antimagic orientations of even regular graphs. 46-53 - Maria Chudnovsky
Perfect divisibility and 2-divisibility. 54-60 - Robert E. L. Aldred
Pairs and triples of forbidden subgraphs and the existence of a 2-factor. 61-82 - Shoham Letzter
The homomorphism threshold of -free graphs. 83-106
Volume 90, Number 2, February 2019
- Éva Czabarka
A tanglegram Kuratowski theorem. 111-122 - Tomás Dvorák
Gray codes extending quadratic matchings. 123-136 - Wiebke Bedenknecht
On the local density problem for graphs of given odd-girth. 137-149 - Saieed Akbari
Highly edge-connected factors using given lists on degrees. 150-159 - Ngoc-Khang Le
Detecting an induced subdivision of K4. 160-171 - Arès Méroueh
The Ramsey number of loose cycles versus cliques. 172-188 - Carol T. Zamfirescu:
Cubic vertices in planar hypohamiltonian graphs. 189-207
Volume 90, Number 3, March 2019
- Hortensia Galeana-Sánchez, César Hernández-Cruz
A dichotomy for the kernel by H-walks problem in digraphs. 213-226 - Beka Ergemlidze, Abhishek Methuku, Nika Salia
A note on the maximum number of triangles in a C5-free graph. 227-230 - Amelia Taylor
On the exact decomposition threshold for even cycles. 231-266 - Atsuhiro Nakamoto, Kenta Noguchi
Spanning bipartite quadrangulations of even triangulations. 267-287 - Sam Spiro
Polynomial relations between matrices of graphs. 288-303 - Borut Luzar
Note on list star edge-coloring of subcubic graphs. 304-310 - Ramin Javadi
Edge clique cover of claw-free graphs. 311-405 - Min Jung Lee, Sungjong No, Seungsang Oh
Arc index of spatial graphs. 406-415 - Allan Lo
Long properly coloured cycles in edge-coloured graphs. 416-442 - Zdenek Dvorák
Triangle-free planar graphs with the smallest independence number. 443-454
Volume 90, Number 4, April 2019
- Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki
Hamiltonicity of planar graphs with a forbidden minor. 459-483 - Florian Barbero, Christophe Paul
Strong immersion is a well-quasi-ordering for semicomplete digraphs. 484-496 - Hannah Spinoza, Douglas B. West
Reconstruction from the deck of -vertex induced subgraphs. 497-522 - Michal Debski
Strong chromatic index of unit distance graphs. 523-534 - Jinghua He, Erling Wei, Dong Ye
On perfect matchings in matching covered graphs. 535-546 - M. Amin Bahmanian
Extending edge-colorings of complete hypergraphs into regular colorings. 547-560 - Liang Zhong
The 1-2-3-conjecture holds for dense graphs. 561-564 - Nishad Kothari
Generating near-bipartite bricks. 565-590 - Valerio Boncompagni, Marko Radovanovic
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. 591-628 - Martin Merker
Bounded diameter arboricity. 629-641
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-12-26 00:37 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: