On separating cycles in graphs

DOI10.1016/0012-365X(78)90047-XMaRDI QIDQ1251670zbMATH OpenWikidataFDO

Authors Carsten Thomassen

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90047-X

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites work

• Chromatic roots and Hamiltonian paths
• Graph theory
• Graphs in which every finite path is contained in a circuit
• Graphs in which every path is contained in a Hamilton path.
• scientific article; zbMATH DE number 3520442 (Why is no real title available?)
• scientific article; zbMATH DE number 3243269 (Why is no real title available?)
• On randomly Hamiltonian graphs
• Parallel concepts in graph theory
• Randomly Traceable Graphs
• Separation of vertices by a circuit

Cited in

(2)

• Non-separating induced cycles in graphs
• Disjoint isolating sets and graphs with maximum isolation number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251670)