A 2-factor with short cycles passing through specified independent vertices in graph

DOI10.1007/S00373-008-0776-XzbMath1156.05047OpenAlexW2048164350MaRDI QIDQ937249

Jiu-ying Dong

Publication date: 20 August 2008

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0776-x

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Small cycles and 2-factor passing through any given vertices in graphs

Cites Work

• On the maximum number of independent cycles in a graph
• Covering vertices of a graph by \(k\) disjoint cycles
• Vertex-disjoint cycles containing specified edges
• Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
• A note on 2-factors with two components
• Existence of two disjoint long cycles in graphs
• Vertex-disjoint cycles of length at most four each of which contains a specified vertex
• Note on Hamilton Circuits
• Degree conditions for 2-factors
• Covering a graph with cycles passing through given edges
• Two‐factors each component of which contains a specified vertex

This page was built for publication: A 2-factor with short cycles passing through specified independent vertices in graph