default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 16
Volume 16, Number 1, March 2000
- Tetsuya Abe, Bumpei Nakano:
Lower Semimodular Types of Lattices: Frankl's Conjecture Holds for Lower Quasi-Semimodular Lattices. 1-16 - Hajo Broersma
, Zdenek Ryjácek, Ingo Schiermeyer:
Closure Concepts: A Survey. 17-48 - Nicholas J. Cavenagh, Elizabeth J. Billington:
Decompositions of Complete Multipartite Graphs into Cycles of Even Length. 49-65 - Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. 67-80 - Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang:
Vertex-Disjoint Cycles Containing Specified Edges. 81-92 - Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg:
Symmetric Graph Designs. 93-102 - Antoni Marczyk:
On Hamiltonian Powers of Digraphs. 103-113 - Jürgen Reinhold:
Frankl's Conjecture Is True for Lower Semimodular Lattices. 115-116 - Guiying Yan, Jiaofeng Pan, C. K. Wong, Taro Tokuda:
Decomposition of Graphs into (g, f)-Factors. 117-126
Volume 16, Number 2, June 2000
- Sarmad Abbasi:
How Tight Is the Bollobás-Komlós Conjecture? 129-137 - Arie Bialostocki, Daniel Schaal:
On a Variation of Schur Numbers. 139-147 - Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
The Generation of Maximal Triangle-Free Graphs. 149-157 - Yuangqiu Huang:
The Maximum Genus on a 3-Vertex-Connected Graph. 159-164 - Hong-Jian Lai:
Group Connectivity of 3-Edge-Connected Chordal Graphs. 165-176 - Mingchu Li:
Longest Cycles in Almost Claw-Free Graphs. 177-198 - James G. Oxley, Haidong Wu:
Matroids and Graphs with Few Non-Essential Elements. 199-229 - Hunter S. Snevily, James A. Foster:
The 2-Pebbling Property and a Conjecture of Graham's. 231-244 - Zhongde Yan, Yue Zhao:
Edge Colorings of Embedded Graphs. 245-256
Volume 16, Number 3, September 2000
- John L. Goldwasser, Cun-Quan Zhang:
Uniquely Edge-3-Colorable Graphs and Snarks. 257-267 - Kazuhide Hirohata:
On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph. 269-273 - D. Frank Hsu, Xiao-Dong Hu, Guo-Hui Lin:
On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces. 275-284 - Manoel Lemos, James G. Oxley, Talmage James Reid:
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. 285-318 - Hao Li:
On Cycles in 3-Connected Graphs. 319-335 - Talmage James Reid, Haidong Wu:
On Non-Essential Edges in 3-Connected Graphs. 337-354 - Romeo Rizzi:
A Note on Range-Restricted Circuit Covers. 355-358 - Hong Wang:
Large Vertex-Disjoint Cycles in a Bipartite Graph. 359-366 - Jianliang Wu:
The Linear Arboricity of Series-Parallel Graphs. 367-372
Volume 16, Number 4, December 2000
- Eric Babson, Julian West:
The Permutations 123 p 4... p m and 321 p 4... p m are Wilf-Equivalent. 373-380 - Andreas Brandstädt, Van Bang Le, Stephan Olariu:
Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles. 381-387 - Emanuela Fachini, János Körner:
Colour Number, Capacity, and Perfectness of Directed Graphs. 389-398 - Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp:
Even Cycles in Graphs with Many Odd Cycles. 399-410 - Xiaoyun Lu, Da-Wei Wang, Jiaofeng Pan, C. K. Wong:
Rooted Spanning Trees in Tournaments. 411-427 - Sean McGuinness:
Colouring Arcwise Connected Sets in the Plane I. 429-439 - Dhruv Mubayi, Douglas B. West:
On the Number of Vertices with Specified Eccentricity. 441-452 - Hong Wang:
Independent Directed Triangles in a Directed Graph. 453-462 - Boris Zgrablic:
A Note on Adjacency-Transitivity of a Graph and Its Complement. 463-465 - Limin Zhang:
Every Planar Graph with Maximum Degree 7 Is of Class 1. 467-495
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-09 19:20 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:
