Publisher
Springer International Publishing
Reference64 articles.
1. N.R. Aravind et al., Bounding χ in terms of ω and Δ for some classes of graphs. Discrete Math. 311, 911–920 (2011)
2. D. Bauer et al., Not every 2-tough graph is Hamiltonian. Discrete Appl. Math. 99, 317–321 (2000)
3. J.A. Bondy, Pancyclic graphs I. J. Comb. Theory B 11, 41–46 (1971)
4. J.A. Bondy, Pancyclic graphs: recent results, in Infinite and Finite Sets. Colloquia Mathematica Societatis János Bolyai (Colloq., Keszthely, 1973), pp. 181–187
5. H. Broersma et al., How many conjectures can you stand? A survey. Graphs Comb. 28, 57–75 (2012)