Cycle Partitions in Graphs

DOI10.1017/S0963548300001887MaRDI QIDQ4715257zbMATH OpenFDO

Authors C. C. Chen, Guoping Jin

Publication date 26 February 1997

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300001887

zbMATH Keywords

cycle partitionsindependent setstability number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Cycles in graphs with prescribed stability number and connectivity
• scientific article; zbMATH DE number 3435542
• scientific article; zbMATH DE number 1161356
• On the structure of -stable graphs
• Stability for vertex cycle covers

Cites work

• Every finite strongly connected digraph of stability 2 has a Hamiltonian path

Cited in

(14)

• Weak cycle partition involving degree sum conditions
• On the stability number of the edge intersection of two graphs.
• Partitioning graphs into paths or cycles of prescribed lengths
• Minimum cycle partition with length requirements
• Mad Tea Party Cyclic Partitions
• scientific article; zbMATH DE number 5914863 (Why is no real title available?)
• King Arthur and his knights with two round tables
• scientific article; zbMATH DE number 6501194 (Why is no real title available?)
• scientific article; zbMATH DE number 3435542 (Why is no real title available?)
• scientific article; zbMATH DE number 6928815 (Why is no real title available?)
• Partitioning a graph into two square-cycles
• Partitioning a graph into cycles with a specified number of chords
• A note on a cycle partition problem
• Cycle partitions of regular graphs

This page was built for publication: Cycle Partitions in Graphs

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