default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 91
Volume 91, Number 1, May 2019
- Sebastián Bustamante, Hiêp Hàn, Maya Stein
:
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. 5-15 - Ilkyoo Choi, Louis Esperet:
Improper coloring of graphs on surfaces. 16-34 - Andrés Ángel, Jerson Borja:
The evasiveness conjecture and graphs on 2p vertices. 35-52 - Pierre Ille, Robert E. Woodrow:
Fractal graphs. 53-72 - Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
On the Kőnig?Egerváry theorem for k?paths. 73-87 - Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer:
An improvement on the maximum number of k?dominating independent sets. 88-97
Volume 91, Number 2, June 2019
- Douglas R. Woodall:
The average degree of a subcubic edge?chromatic critical graph. 103-121 - Oliver Schaudt, Maya Stein:
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. 122-147 - Seog-Jin Kim, Kenta Ozeki:
A note on a Brooks' type theorem for DP?coloring. 148-161 - Zdenek Dvorák:
On distance r?dominating and 2r?independent sets in sparse graphs. 162-173 - Bart Litjens:
On dihedral flows in embedded graphs. 174-191 - Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique-cutsets beyond chordal graphs. 192-246
Volume 91, Number 3, July 2019
- Julien Baste, Dieter Rautenbach, Ignasi Sau:
Upper bounds on the uniquely restricted chromatic index. 251-258 - Paul Wollan, David R. Wood:
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. 259-266 - Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Hereditary graph classes: When the complexities of coloring and clique cover coincide. 267-289 - Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
The size?Ramsey number of powers of paths. 290-299
Volume 91, Number 4, August 2019
- Olivier Durand de Gevigney, Zoltán Szigeti:
On (2, k)?connected graphs. 305-325 - Lucas Mol, Ortrud R. Oellermann:
Maximizing the mean subtree order. 326-352 - António Girão, Shoham Letzter, Julian Sahasrabudhe:
Partitioning a graph into monochromatic connected subgraphs. 353-364 - Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending partial representations of circle graphs. 365-394
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-03-04 21:11 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:
