@article{Abe-Nakano/00,
AUTHOR = {Abe, Tetsuya and Nakano, Bumpei},
TITLE = {Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {1-16},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Broersma-Ryjacek-Schiermeyer/00,
AUTHOR = {Broersma, Hajo and Ryj{\'a}{\v{c}}ek, Zden{\v{e}}k and Schiermeyer, Ingo},
TITLE = {Closure concepts: A survey},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {17-48},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Cavenagh-Billington/00,
AUTHOR = {Cavenagh, Nicholas J. and Billington, Elizabeth J.},
TITLE = {Decompositions of complete multipartite graphs into cycles of even length},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {49-65},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Chen-Faudree-Gould-Jacobson-Lesniak/00,
AUTHOR = {Chen, Guantao and Faudree, Ralph J. and Gould, Ronald J. and Jacobson, Michael S. and Lesniak, Linda},
TITLE = {Cycles in 2-factors of balanced bipartite graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {67-80},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Egawa-Faudree-Gyori-Ishigami-Schelp-Wang/00,
AUTHOR = {Egawa, Yoshimi and Faudree, Ralph J. and Gy{\"o}ri, Ervin and Ishigami, Yoshiyasu and Schelp, Richard H. and Wang, Hong},
TITLE = {Vertex-disjoint cycles containing specified edges},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {81-92},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Gronau-Mullin-Rosa-Schellenberg/00,
AUTHOR = {Gronau, H.-D.O.F. and Mullin, R.C. and Rosa, A. and Schellenberg, P.J.},
TITLE = {Symmetric graph designs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {93-102},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Marczyk/00,
AUTHOR = {Marczyk, Antoni},
TITLE = {On Hamiltonian powers of digraphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {103-113},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Reinhold/00,
AUTHOR = {Reinhold, J{\"u}rgen},
TITLE = {Frankl's conjecture is true for lower semimodular lattices},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {115-116},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Yan-Pan-Wong-Tokuda/00,
AUTHOR = {Yan, G.Y. and Pan, J.F. and Wong, C.K. and Tokuda, Taro},
TITLE = {Decomposition of graphs into $(g,f)$-factors},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {1},
PAGES = {117-126},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Abbasi/00,
AUTHOR = {Abbasi, Sarmad},
TITLE = {How tight is the Bollob{\'a}s-Koml{\'o}s conjecture?},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {129-137},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Bialostocki-Schaal/00,
AUTHOR = {Bialostocki, Arie and Schaal, Daniel},
TITLE = {On a variation of Schur numbers},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {139-147},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Brandt-Brinkmann-Harmuth/00,
AUTHOR = {Brandt, Stephan and Brinkmann, Gunnar and Harmuth, Thomas},
TITLE = {The generation of maximal triangle-free graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {149-157},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Huang/00,
AUTHOR = {Huang, Yuangqiu},
TITLE = {The maximum genus on a 3-vertex-connected graph},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {159-164},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Lai/00,
AUTHOR = {Lai, Hong-Jian},
TITLE = {Group connectivity of 3-edge-connected chordal graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {165-176},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Li/00,
AUTHOR = {Li, MingChu},
TITLE = {Longest cycles in almost claw-free graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {177-198},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Oxley-Wu/00,
AUTHOR = {Oxley, James and Wu, Haidong},
TITLE = {Matroids and graphs with few non-essential elements},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {199-229},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Snevily-Foster/00,
AUTHOR = {Snevily, Hunter S. and Foster, James A.},
TITLE = {The 2-pebbling property and a conjecture of Graham's},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {231-244},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Yan-Zhao/00,
AUTHOR = {Yan, Zhongde and Zhao, Yue},
TITLE = {Edge colorings of embedded graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {2},
PAGES = {245-256},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Goldwasser-Zhang/00,
AUTHOR = {Goldwasser, John L. and Zhang, Cun-Quan},
TITLE = {Uniquely edge-3-colorable graphs and snarks},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {257-267},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Hirohata/00,
AUTHOR = {Hirohata, Kazuhide},
TITLE = {On the existence of a long path between specified vertices in a 2-connected graph},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {269-273},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Hsu-Hu-Lin/00,
AUTHOR = {Hsu, D. Frank and Hu, Xiao-Dong and Lin, Guo-Hui},
TITLE = {On minimum-weight $k$-edge connected Steiner networks on metric spaces},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {275-284},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Lemos-Oxley-Reid/00,
AUTHOR = {Lemos, Manoel and Oxley, James and Reid, Talmage James},
TITLE = {On the 3-connected matroids that are minimal having a fixed restriction},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {285-318},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Li/00a,
AUTHOR = {Li, Hao},
TITLE = {On cycles in 3-connected graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {319-335},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Reid-Wu/00,
AUTHOR = {Reid, Talmage James and Wu, Haidong},
TITLE = {On non-essential edges in 3-connected graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {337-354},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Rizzi/00a,
AUTHOR = {Rizzi, Romeo},
TITLE = {A note on range-restricted circuit covers},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {355-358},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Wang/00,
AUTHOR = {Wang, Hong},
TITLE = {Large vertex-disjoint cycles in a bipartite graph},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {359-366},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Wu/00,
AUTHOR = {Wu, Jianliang},
TITLE = {The linear arboricity of series-parallel graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {3},
PAGES = {367-372},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
}
@article{Babson-West/00,
AUTHOR = {Babson, Eric and West, Julian},
TITLE = {The permutations $123p_4...p_m$ and $321p_4...p_m$ are Wilf-equivalent},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {373-380},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Brandstadt-Van_Bang-Olariu/00,
AUTHOR = {Brandst{\"a}dt, Andreas and Van Bang, Le and Olariu, Stephan},
TITLE = {Efficiently recognizing the $P_4$-structure of trees and of bipartite graphs without short cycles},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {381-387},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Fachini-Korner/00,
AUTHOR = {Fachini, Emanuela and K{\"o}rner, J{\'a}nos},
TITLE = {Colour number, capacity, and perfectness of directed graphs},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {389-398},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Faudree-Flandrin-Jacobson-Lehel-Schelp/00,
AUTHOR = {Faudree, Ralph J. and Flandrin, Evelyne and Jacobson, Michael S. and Lehel, Jen{\"o} and Schelp, Richard H.},
TITLE = {Even cycles in graphs with many odd cycles},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {399-410},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Lu-Wang-Pan/00,
AUTHOR = {Lu, Xiaoyun and Wang, Da-Wei and Pan, Jiaofeng},
TITLE = {Rooted spanning trees in tournaments},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {411-427},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{McGuinness/00,
AUTHOR = {McGuinness, Sean},
TITLE = {Colouring arcwise connected sets in the plane I},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {429-439},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Mubayi-West/00,
AUTHOR = {Mubayi, Dhruv and West, Douglas B.},
TITLE = {On the number of vertices with specified eccentricity},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {441-452},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Wang/00a,
AUTHOR = {Wang, Hong},
TITLE = {Independent directed triangles in a directed graph},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {453-462},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Zgrablic/00,
AUTHOR = {Zgrabli{\'c}, Boris},
TITLE = {A note on adjacency-transitivity of a graph and its complement},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {463-465},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}
@article{Zhang/00,
AUTHOR = {Zhang, Limin},
TITLE = {Every planar graph with maximum degree 7 is of class 1},
JOURNAL = {Graphs and Combinatorics},
VOLUME = {16},
NUMBER = {4},
PAGES = {467-495},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Tokyo},
TYPE = {proceeding},
}