Two vertex-disjoint cycles in a graph

DOI10.1007/BF01787818zbMath0838.05073OpenAlexW1997341083MaRDI QIDQ1906862

Hong Wang

Publication date: 13 February 1996

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

Full work available at URL: https://doi.org/10.1007/bf01787818

zbMATH Keywords

vertex-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Covering vertices of a graph by \(k\) disjoint cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint long cycles in a graph

Cites Work

• Partition of a bipartite graph into cycles
• A method in graph theory
• Pancyclic graphs. I
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Two vertex-disjoint cycles in a graph