Global cycle properties in graphs with large minimum clustering coefficient

DOI10.2989/16073606.2016.1253626zbMath1422.05056arXiv1506.03691OpenAlexW2963878341MaRDI QIDQ5236152

Skylar Nicol, Ortrud R. Oellermann, Adam Borchert

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03691

zbMATH Keywords

locally connectedfully-cycle extendableminimum clustering coefficientRyjáček's conjecturestrongly induced sub-graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global cycle properties of locally isometric graphs
• Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Extending cycles in graphs
• Some localization theorems on Hamiltonian circuits
• A note on locally connected and Hamiltonian-connected graphs
• Complexity of the hamiltonian cycle in regular graph problem
• Research problems.
• Pancyclicity and NP-completeness in planar graphs
• Pancyclic graphs. I
• A strengthening of Kikustapos;s theorem
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Locally connected graphs
• Hamiltonian Chordal Graphs are not Cycle Extendable
• Collective dynamics of ‘small-world’ networks
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Global cycle properties in graphs with large minimum clustering coefficient