Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 81
Volume 81, Number 1, January 2016
- Hongliang Lu:
An Extension of Cui-Kano's Characterization on Graph Factors. 5-15 - Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs. 16-29 - Andrew D. King, Bruce A. Reed:
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω. 30-34 - Eduard Eiben, Michal Kotrbcík:
Equimatchable Graphs on Surfaces. 35-49 - Geoffrey Exoo, Robert Jajcay:
Biregular Cages of Odd Girth. 50-56 - James Alexander, Tim Mink:
A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs. 57-72 - L'udmila Bezegová, Borut Luzar
, Martina Mockovciaková, Roman Soták, Riste Skrekovski:
Star Edge Coloring of Some Classes of Graphs. 73-82 - Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang:
On Perfect Matching Coverings and Even Subgraph Coverings. 83-91 - Ramin Javadi, Zeinab Maleki, Behnaz Omoomi:
Local Clique Covering of Claw-Free Graphs. 92-104
Volume 81, Number 2, February 2016
- Sébastien Bubeck, Nati Linial:
On the Local Profiles of Trees. 109-119 - Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera:
Circuit Covers of Signed Graphs. 120-133 - David Conlon, Maya Stein:
Monochromatic Cycle Partitions in Local Edge Colorings. 134-145 - Wayne Goddard, Honghai Xu:
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs. 146-153 - Stephan G. Wagner, Hua Wang:
On the Local and Global Means of Subtree Orders. 154-166 - K. C. Chang:
Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs. 167-207
Volume 81, Number 3, March 2016
- Irena Penev:
Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable. 213-235 - Tom Eccles:
Graphs of Large Linear Size Are Antimagic. 236-261 - Heping Zhang, Wuyang Sun:
3-Factor-Criticality of Vertex-Transitive Graphs. 262-271 - Henning Bruhn, Richard Lang, Maya Stein:
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. 272-282 - Ilkyoo Choi, Bernard Lidický, Derrick Stolee:
On Choosability with Separation of Planar Graphs with Forbidden Cycles. 283-306 - Dhruv Mubayi:
Coloring Triple Systems with Local Conditions. 307-311
Volume 81, Number 4, April 2016
- János Barát, Gábor N. Sárközy:
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles. 317-328 - Iain Moffatt:
Excluded Minors and the Ribbon Graphs of Knots. 329-341 - Dirk Meierling, Janina Müttel, Dieter Rautenbach:
Cycles Avoiding a Color in Colorful Graphs. 342-350 - Igor C. Oliveira, Bhalchandra D. Thatte:
An Algebraic Formulation of the Graph Reconstruction Conjecture. 351-363 - Ricky Rotheram, Sanming Zhou:
Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes. 364-392 - Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Digraphs with Large Arc-Strong Connectivity. 393-402 - Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. 403-413
a service of 
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-12 02:19 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:
