Induced Subgraphs of the Power of a Cycle

DOI10.1137/0402039MaRDI QIDQ3490041zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Claudine Peyrat

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0402039

zbMATH Keywords

girthinduced subgraphminimum degreenumber of verticespower of a cycle

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Long cycles in subgraphs with prescribed minimum degree
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Classes of cubic graphs containing cycles of integer-power lengths
• Minimum Degrees for Powers of Paths and Cycles
• scientific article; zbMATH DE number 4103118

Cited in

(8)

• Independence polynomials of circulants with an application to music
• On approximating the \(d\)-girth of a graph
• On Approximating the d-Girth of a Graph
• Parameterized complexity of finding small degree-constrained subgraphs
• On the approximability of some degree-constrained subgraph problems
• Biclique-colouring verification complexity and biclique-colouring power graphs
• Colouring clique-hypergraphs of circulant graphs
• Minimum degree and density of binary sequences

This page was built for publication: Induced Subgraphs of the Power of a Cycle

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