default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 82
Volume 82, Number 1, May 2016
- Nishad Kothari
, Uppaluri S. R. Murty:
K4-free and C6¯-free Planar Matching Covered Graphs. 5-32 - Yoshimi Egawa, Michitaka Furuya:
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. 33-44 - Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. 45-64 - David Cariolaro, Romeo Rizzi:
On the Complexity of Computing the Excessive [B]-Index of a Graph. 65-74 - Sogol Jahanbekam, Douglas B. West:
Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees. 75-89 - Jason I. Brown, Aysel Erey:
On the Roots of σ-Polynomials. 90-102 - Michael Tait, Craig Timmons:
Orthogonal Polarity Graphs and Sidon Sets. 103-116
Volume 82, Number 2, June 2016
- Jie Ma, Qiqin Xie, Xingxing Yu:
Graphs Containing Topological H. 121-153 - Florian Pfender, Gordon F. Royle:
Quartic Graphs with Every Edge in a Triangle. 154-164 - Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and Planar Oriented Cliques. 165-193 - Jørgen Bang-Jensen, Tilde My Larsen:
DAG-Width and Circumference of Digraphs. 194-206 - Guoli Ding, Stan Dziobiak, Haidong Wu:
Large Wk- or K3, t-Minors in 3-Connected Graphs. 207-217 - Zoltán Füredi, Ida Kantor:
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs. 218-227
Volume 82, Number 3, July 2016
- Gregory Z. Gutin:
Note on Perfect Forests. 233-235 - Waseem Abbas, Magnus Egerstedt, Chun-Hung Liu, Robin Thomas, Peter Whalen:
Deploying Robots With Two Sensors in K1, 6-Free Graphs. 236-252 - Guoli Ding, Perry Iverson:
Hall-Type Results for 3-Connected Projective Graphs. 253-264 - Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Cyclic 4-Colorings of Graphs on Surfaces. 265-278 - Moharram N. Iradmusa, Cheryl E. Praeger:
Two-sided Group Digraphs and Graphs. 279-295 - Barbara M. Maenhaut, Benjamin R. Smith:
Face 2-Colorable Embeddings with Faces of Specified Lengths. 296-311 - Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval Minors of Complete Bipartite Graphs. 312-321 - Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. 322-333
Volume 82, Number 4, August 2016
- Fei-Huang Chang, Yu-Chang Liang, Zhishi Pan, Xuding Zhu:
Antimagic Labeling of Regular Graphs. 339-349 - Armen S. Asratian, Carl Johan Casselgren:
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results. 350-373 - Bobby DeMarco, Amanda Redlich:
Graph Decomposition and Parity. 374-386 - Dan McQuillan, R. Bruce Richter:
On the Crossing Number of Kn without Computer Assistance. 387-432 - Edita Mácajová, Ján Mazák:
Cubic Graphs with Large Circumference Deficit. 433-440
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-14 21:16 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:
