On separating cycles in graphs

DOI10.1016/0012-365X(78)90047-XzbMath0392.05041WikidataQ127957247 ScholiaQ127957247MaRDI QIDQ1251670

Carsten Thomassen

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

2-Connected Graphs Without Separating CyclesComplete Bipartite GraphsComplete GraphsConnected GraphSeparating Cycles GraphsWheels

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Non-separating induced cycles in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separation of vertices by a circuit
• Parallel concepts in graph theory
• Chromatic roots and Hamiltonian paths
• On randomly Hamiltonian graphs
• Graphs in which every finite path is contained in a circuit
• Graphs in which every path is contained in a Hamilton path.
• Randomly Traceable Graphs

This page was built for publication: On separating cycles in graphs