default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 85
Volume 85, Number 1, May 2017
- Brendan D. McKay
:
Hypohamiltonian Planar Cubic Graphs with Girth 5. 7-11 - Leonardo Nagami Coregliano, Alexander A. Razborov:
On the Density of Transitive Tournaments. 12-21 - Adam Gagol, Piotr Micek, Bartosz Walczak:
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. 22-50 - Attila Joó:
Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. 51-55 - Robert Sámal:
Cycle-Continuous Mappings - Order Structure. 56-73 - Fengming Dong, Weigen Yan:
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. 74-93 - Paul S. Wenger, Douglas B. West:
Uniquely Cycle-Saturated Graphs. 94-106 - Gérard D. Cohen, Emanuela Fachini, János Körner:
Path Separation by Short Cycles. 107-114 - Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka:
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. 115-132 - Matthew White:
The Monochromatic Circumference of 2-Edge-Colored Graphs. 133-151 - Liying Kang, Nicholas C. Wormald:
Minimum Power Dominating Sets of Random Cubic Graphs. 152-171 - Ilkyoo Choi:
Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable. 172-186 - Kenta Noguchi:
Even Embeddings of the Complete Graphs and Their Cycle Parities. 187-206 - Matthias Kriesell:
Unique Colorability and Clique Minors. 207-216 - Krystal Guo, Bojan Mohar:
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. 217-248 - Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer:
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. 249-257 - Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. 258-277 - Michael Stiebitz:
A Relaxed Version of the Erdős-Lovász Tihany Conjecture. 278-287 - Kolja Knauer, Petru Valicov, Paul S. Wenger:
Planar Digraphs without Large Acyclic Sets. 288-291
Volume 85, Number 2, June 2017
- René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. 297-335 - Penny E. Haxell, Alexander D. Scott:
On Lower Bounds for the Matching Number of Subcubic Graphs. 336-348 - Andrey Grinshpun, Raj Raina, Rik Sengupta:
Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques. 349-362 - Giuseppe Mazzuoccolo, Eckhard Steffen:
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. 363-371 - Gregory Z. Gutin, Anders Yeo:
Note on Perfect Forests in Digraphs. 372-377 - Tatiana Romina Hartinger, Martin Milanic:
Partial Characterizations of 1-Perfectly Orientable Graphs. 378-394 - Cristina Dalfó, Miguel Angel Fiol:
A Note on the Order of Iterated Line Digraphs. 395-399 - Henry Liu, Teresa Sousa:
Decompositions of Graphs into Fans and Single Edges. 400-411 - Jixian Meng, Gregory J. Puleo, Xuding Zhu:
On (4, 2)-Choosable Graphs. 412-428 - Barnaby Roberts:
Partite Saturation Problems. 429-445 - Asaf Ferber, Michael Krivelevich, Gal Kronenberg:
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. 446-465 - Nati Linial, Jonathan Mosheiff:
On the Rigidity of Sparse Random Graphs. 466-480 - James M. Carraher, William B. Kinnersley, Benjamin Reiniger, Douglas B. West:
The Game Saturation Number of a Graph. 481-495 - Lothar Narins, Tuan Tran:
A Density Turán Theorem. 496-524 - Robert Lukot'ka, Edita Rollová:
Perfect Matchings of Regular Bipartite Graphs. 525-532 - Alexander Pott, Yue Zhou:
Cayley Graphs of Diameter 2 from Difference Sets. 533-544 - Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni:
Disjoint Paths in Decomposable Digraphs. 545-567 - Hyoungjun Kim, Thomas Mattman, Seungsang Oh:
Bipartite Intrinsically Knotted Graphs with 22 Edges. 568-584 - Izak Broere, Moroli D. V. Matsoha:
Applications of Hajós-Type Constructions to the Hedetniemi Conjecture. 585-594
Volume 85, Number 3, July 2017
- Maria Axenovich, Torsten Ueckerdt, Pascal Weiner:
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. 601-618 - Jianfeng Hou, Qinghou Zeng:
On a Problem of Judicious k-Partitions of Graphs. 619-643 - Peter Nelson:
On the Probability that a Random Subgraph Contains a Circuit. 644-650 - Xuding Zhu:
A Hypercube Variant with Small Diameter. 651-660 - Sergey Kitaev:
Existence of u-Representation of Graphs. 661-668 - Marthe Bonamy, Jakub Przybylo:
On the Neighbor Sum Distinguishing Index of Planar Graphs. 669-690 - Xiao Chang, Hao Xu:
Chung-Yau Invariants and Graphs with Symmetric Hitting Times. 691-705 - Maciej Kalkowski, Michal Karonski, Florian Pfender:
The 1-2-3-Conjecture for Hypergraphs. 706-715
Volume 85, Number 4, August 2017
- Daniel W. Cranston, Bobby Jaeger:
List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. 721-737 - Alan Arroyo, R. Bruce Richter:
Characterizing Graphs with Crossing Number at Least 2. 738-746 - Felix Joos:
Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs. 747-758 - Lingsheng Shi, Hongyu Xu:
Large Induced Forests in Graphs. 759-779 - John Engbers:
Maximizing H-Colorings of Connected Graphs with Fixed Minimum Degree. 780-787 - Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. 788-802 - Fedor Petrov:
General Parity Result and Cycle-Plus-Triangles Graphs. 803-807 - Júlio César Silva Araújo, Alexandre A. Cezar, Ana Silva:
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. 808-813 - Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Coloring Graphs with Constraints on Connectivity. 814-838
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-01-04 01:02 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:
