Two vertex-disjoint cycles in a graph

DOI10.1007/BF01787818zbMATH Open0838.05073OpenAlexW1997341083MaRDI QIDQ1906862FDOQ1906862

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)

Cites Work

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

Cited In (5)

• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Title not available (Why is that?)
• Disjoint long cycles in a graph
• Covering vertices of a graph by \(k\) disjoint cycles
• Two disjoint cycles in digraphs

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

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