Average distance in colored graphs
- 作者Peter Dankelmann; Wayne Goddard; Peter Slater
- 卷第38卷
- 期第1期
- 印刷ISSN0364-9024
- 电子ISSN1097-0118
- 文件大小142.53KB
- 发表时间2001
- DOI10.1002/jgt.1020
- 页码1-17
Non-path spectrum setsGuantao Chen; Ralph. J. Faudree; Xuechao Li; Ingo Schiermeyer · 2008
Closures, cycles, and pathsJochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer · 2012
Vertex pancyclic graphsBert Randerath; Ingo Schiermeyer; Meike Tewes; Lutz Volkmann · 2002
Small cycles in Hamiltonian graphsUwe Schelten; Ingo Schiermeyer · 1997
Vertex Pancyclic GraphsBert Randerath; Lutz Volkmann; Ingo Schiermeyer; Meike Tewes · 1999
Extremal Problems for Imbalanced EdgesDieter Rautenbach; Ingo Schiermeyer · Graphs and Combinatorics · 2006
Rainbows in the HypercubeMaria Axenovich; Heiko Harborth; Arnfried Kemnitz; Meinhard Möller; Ingo Schiermeyer · Graphs and Combinatorics · 2007
Closure Concepts: A SurveyHajo Broersma; Zdeněk Ryjáček; Ingo Schiermeyer · Graphs and Combinatorics · 2000