Vertex Colouring and Forbidden Subgraphs – A Survey
✍ Scribed by Bert Randerath; Ingo Schiermeyer
- Book ID
- 106047485
- Publisher
- Springer Japan
- Year
- 2004
- Tongue
- English
- Weight
- 641 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this paper, we consider forbidden subgraphs which force the existence of a 2‐factor. Let \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}${\cal G}$\end{document} be the class of connected graphs of minimum degree at least two and maximum degree at least three, an
Because vertices most central with respect to the center (minimax distance) criterion and the median (minisum distance) criterion can be arbitrarily far apart even in trees, several sequences of central sets have been introduced. Each such sequence is based on an underlying concept that shows the ce