default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 84
Volume 84, Number 1, January 2017
- Guangjun Xu, Sanming Zhou
:
Hadwiger's Conjecture for the Complements of Kneser Graphs. 5-16 - Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu:
On k-Maximal Strength Digraphs. 17-25 - Jean-Florent Raymond, Dimitrios M. Thilikos:
Low Polynomial Exclusion of Planar Graph Patterns. 26-44 - Noga Alon, Tom Bohman, Hao Huang:
More on the Bipartite Decomposition of Random Graphs. 45-52 - Michael Molloy:
The Adaptable Chromatic Number and the Chromatic Number. 53-56 - Irena Penev:
Amalgams and χ-Boundedness. 57-92 - Marthe Bonamy, Ross J. Kang:
List Coloring with a Bounded Palette. 93-103
Volume 84, Number 2, February 2017
- Ligang Jin, Eckhard Steffen:
Petersen Cores and the Oddness of Cubic Graphs. 109-120 - Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu:
Planar Hypohamiltonian Graphs on 40 Vertices. 121-133 - Jonathan Cutler, A. J. Radcliffe:
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree. 134-145 - Henning Bruhn, Laura Gellert, Jacob Günther:
Jacobsthal Numbers in Generalized Petersen Graphs. 146-157 - Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly Even-Cycle Decomposable Graphs. 158-175 - Michel Surmacs:
Regular Hypertournaments and Arc-Pancyclicity. 176-190 - Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Characterization of Digraphic Sequences with Strongly Connected Realizations. 191-201 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West:
Minimum Degree and Dominating Paths. 202-213
Volume 84, Number 3, March 2017
- Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with No Induced Five-Vertex Path or Antipath. 221-232 - Nicolas Trotignon, Kristina Vuskovic:
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. 233-248 - Binlong Li, Petr Vrána:
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity. 249-261 - Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-Coloring P6-Free Graphs with No Induced 5-Cycles. 262-285 - Seongmin Ok, Carsten Thomassen:
On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs. 286-296 - César Hernández-Vélez, Jesús Leaños, Gelasio Salazar:
On the Pseudolinear Crossing Number. 297-310 - Agelos Georgakopoulos, Stephan Wagner:
Hitting Times, Cover Cost, and the Wiener Index of a Tree. 311-326
Volume 84, Number 4, April 2017
- Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. 331-363 - Daniel J. Harvey, David R. Wood:
Parameters Tied to Treewidth. 364-385 - Svante Janson, Andrew J. Uzzell:
On String Graph Limits and the Structure of a Typical String Graph. 386-407 - Ararat Harutyunyan, Bojan Mohar:
Planar Digraphs of Digirth Five Are 2-Colorable. 408-427 - Eric Sullivan, Paul S. Wenger:
Saturation Numbers in Tripartite Graphs. 428-442 - Gábor Wiener:
Leaf-Critical and Leaf-Stable Graphs. 443-459 - Bin Jia, David R. Wood:
Hadwiger's Conjecture for ℓ-Link Graphs. 460-476 - Alexey Pokrovskiy:
Calculating Ramsey Numbers by Partitioning Colored Graphs. 477-500 - Robert Brignall, Nicholas Korpelainen, Vincent Vatter:
Linear Clique-Width for Hereditary Classes of Cographs. 501-511 - Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
Locally 3-Transitive Graphs of Girth 4. 512-520 - Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh:
(1, k)-Coloring of Graphs with Girth at Least Five on a Surface. 521-535 - Martin Milanic, Nicolas Trotignon:
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. 536-551 - Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young:
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. 552-565 - Zoltán Lóránt Nagy:
On the Number of k-Dominating Independent Sets. 566-580
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-09-19 23:34 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:
