default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 87
Volume 87, Number 1, January 2018
- Young Soo Kwon
:
Classification of Regular Embeddings of Complete Multipartite Graphs. 5-17 - Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Achromatic and Harmonious Colorings of Circulant Graphs. 18-34 - Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, Ali Iranmanesh:
Equimatchable Regular Graphs. 35-45 - Xinmin Hou, Yu Qiu, Boyuan Liu:
Decomposition of Graphs into (k, r)-Fans and Single Edges. 46-60 - Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Degree Conditions for Matchability in 3-Partite Hypergraphs. 61-71 - Rong Chen, Geoff Whittle:
On Recognizing Frame and Lifted-Graphic Matroids. 72-76 - Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. 77-88 - Éva Czabarka, László A. Székely, Stephan G. Wagner:
On the Number of Nonisomorphic Subtrees of a Tree. 89-95 - Attila Joó:
Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs. 96-107 - Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. 108-129
Volume 87, Number 2, February 2018
- Ying-li Kang, Eckhard Steffen:
Circular coloring of signed graphs. 135-148 - Luke Sernau:
Graph operations and upper bounds on graph homomorphism counts. 149-163 - Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput:
On the number of hamiltonian cycles in triangulations with few separating triangles. 164-175 - Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota:
On an anti-Ramsey threshold for sparse graphs with one triangle. 176-187 - Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of k-critical H-free graphs. 188-207 - Hamed Hatami, Svante Janson, Balázs Szegedy:
Graph properties, graph limits, and entropy. 208-229 - Tom Kelly, Luke Postle:
Exponentially many 4-list-colorings of triangle-free graphs on surfaces. 230-238 - Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Some results on cyclic interval edge colorings of graphs. 239-252 - (Withdrawn) Quasi-graphic matroids. 253-264
Volume 87, Number 3, March 2018
- Maria Chudnovsky:
A short proof of the wonderful lemma. 271-274 - Henning Bruhn, Felix Joos, Oliver Schaudt:
Long cycles through prescribed vertices have the Erdős-Pósa property. 275-284 - Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. 285-304 - Hu Ye Chen, Zai Ping Lu:
Edge-transitive homogeneous factorizations of complete uniform hypergraphs. 305-316 - Alexandre Talon, Jan Kratochvíl:
Completion of the mixed unit interval graphs hierarchy. 317-332 - Paul Horn:
Rainbow spanning trees in complete graphs colored by one-factorizations. 333-346 - Jaehoon Kim, Seongmin Ok:
Dynamic choosability of triangle-free graphs and sparse random graphs. 347-355 - Peter J. Dukes, Garret Flowers:
Configurations containing a given linear hypergraph. 356-361 - Shinya Fujita, Ruonan Li, Shenggui Zhang:
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. 362-373 - Zhiquan Hu, Feifei Song:
Long cycles passing through ⌊4k+13⌋ vertices in k-connected graphs. 374-393
Volume 87, Number 4, April 2018
- Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches:
Edge-colorings avoiding rainbow stars. 399-429 - Christina Graves, Stephen J. Graves, Lindsey-Kay Lauderdale:
Smallest graphs with given generalized quaternion automorphism group. 430-442 - Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. 443-459 - Mirko Petrusevski:
Odd 4-edge-colorability of graphs. 460-474 - Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec:
Grünbaum colorings of even triangulations on surfaces. 475-491 - Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le:
List coloring digraphs. 492-508 - Metrose Metsidik, Xian'an Jin:
Eulerian partial duals of plane graphs. 509-515 - Steven Schluchter:
Applications of ordinary voltage graph theory to graph embeddability. 516-525 - Gábor Wiener:
New constructions of hypohamiltonian and hypotraceable graphs. 526-535 - Frédéric Havet, Ana Karolinna Maia, Bojan Mohar:
Finding a subdivision of a prescribed digraph of order 4. 536-560 - Burkhard Monien, Gerd Wechsung:
Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. 561-580 - Wenwen Fan, Cai Heng Li:
The complete bipartite graphs with a unique edge-transitive embedding. 581-586 - Ahmad Abdi, Bertrand Guenin:
Packing odd T-joins with at most two terminals. 587-652 - Serge Gaspers, Simon Mackenzie:
On the number of minimal separators in graphs. 653-659 - Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. 660-671
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-15 20:36 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:
