Graphs constructible from cycles and complete graphs

DOI10.1016/J.DISC.2017.05.002MaRDI QIDQ2359972zbMATH OpenOpenAlexFDO

Authors Robert E. Jamison, Henry Martyn Mulder

Publication date 23 June 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2017.05.002

zbMATH Keywords

\(\varTheta_n\)-closed\(m\)-sumcliquecycleMenger's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A construction of 3-connected graphs
• SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
• The extremal function for three disjoint theta graphs.
• scientific article; zbMATH DE number 2028650
• scientific article; zbMATH DE number 817556

Cites work

• A Characterization of Block-Graphs
• Parallel concepts in graph theory
• Reconstruction of Cacti

Cited in

(3)

• Structural conditions for cycle completable graphs
• Dyadic representations of graphs
• A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder

This page was built for publication: Graphs constructible from cycles and complete graphs

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