Vertex-disjoint cycles containing specified edges
From MaRDI portal
Publication:1972323
DOI10.1007/s003730050005zbMath0951.05061OpenAlexW2047313674MaRDI QIDQ1972323
Yoshiyasu Ishigami, Yoshimi Egawa, Hong Wang, Ralph J. Faudree, Ervin Gyoeri, Richard H. Schelp
Publication date: 2 January 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050005
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (21)
On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Subdivision extendibility ⋮ A minimum degree condition forcing a digraph to be k-linked ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ Chorded cycles ⋮ Minimum degree conditions for \(H\)-linked graphs ⋮ Degree sum conditions for vertex-disjoint cycles passing through specified vertices ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ An improved linear edge bound for graph linkages ⋮ Packing disjoint cycles over vertex cuts ⋮ Small cycles and 2-factor passing through any given vertices in graphs ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ \(k\) disjoint cycles containing specified independent vertices ⋮ On 2-factors with cycles containing specified edges in a bipartite graph ⋮ A look at cycles containing specified elements of a graph ⋮ Vertex-disjoint 4-cycles containing specified edges in a bipartite graph ⋮ Results and problems on chorded cycles: a survey
This page was built for publication: Vertex-disjoint cycles containing specified edges