A note on a cycle partition problem

DOI10.1016/j.aml.2011.02.003zbMath1223.05146MaRDI QIDQ533476

Fengli Yang, Elkin Vumar

Publication date: 3 May 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.02.003

zbMATH Keywords

partition; circumference; longest cycle; dominating cycle; path partition conjecture

Mathematics Subject Classification ID

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Vertex-disjoint subgraphs with high degree sums, On the existence of vertex-disjoint subgraphs with high degree sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The path partition conjecture is true for claw-free graphs
• On a cycle partition problem
• Path partitions and \(P_{n}\)-free sets
• Graphs with not all possible path-kernels
• Relative length of longest paths and cycles in graphs
• Degree sum and connectivity conditions for dominating cycles
• Longest path partitions in generalizations of tournaments
• An asymptotic result for the path partition conjecture
• Relative length of longest paths and cycles in 3-connected graphs
• Relative length of long paths and cycles in graphs with large degree sums
• The directed path partition conjecture
• Some Theorems on Abstract Graphs
• Degree sums, connectivity and dominating cycles in graphs