Degree conditions for 2-factors
From MaRDI portal
Publication:4333458
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O" /><165::AID-JGT4>3.0.CO;2-O 10.1002/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-OzbMath0879.05060OpenAlexW2002960280MaRDI QIDQ4333458
Ronald J. Gould, Stephan Brandt, Ralph J. Faudree, Linda Lesniak, Guantao Chen
Publication date: 12 January 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199702)24:2<165::aid-jgt4>3.0.co;2-o
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (50)
Closures, cycles, and paths ⋮ Toughness, degrees and 2-factors ⋮ Cycles of Given Size in a Dense Graph ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ The confirmation of a conjecture on disjoint cycles in a graph ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs ⋮ Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ Partition of a graph into cycles and vertices ⋮ Subdivision extendibility ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ A vertex cover with chorded 4-cycles ⋮ 2-factors with the bounded number of components in line graphs ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Partition of a graph into cycles and degenerated cycles ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ Subdivisions of graphs: A generalization of paths and cycles ⋮ Edge-dominating cycles in graphs ⋮ Degree sum conditions for vertex-disjoint cycles passing through specified vertices ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ On 2-factors with \(k\) components ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ On degree sum conditions for directed path-factors with a specified number of paths ⋮ Magic labeling of disjoint union graphs ⋮ Independent triangles covering given vertices of a graph ⋮ Graph partition into \(K_{3}\)s and \(K_{4}\)s ⋮ A degree condition of 2-factors in bipartite graphs ⋮ A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ \(k\) disjoint cycles containing specified independent vertices ⋮ Weak cycle partition involving degree sum conditions ⋮ On 2-factors with cycles containing specified edges in a bipartite graph ⋮ Degree conditions for the partition of a graph into cycles, edges and isolated vertices ⋮ On 2-factors with cycles containing specified vertices in a bipartite graph ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ On 2-factors containing 1-factors in bipartite graphs ⋮ Vertex-magic labelings of regular graphs. II. ⋮ Unnamed Item ⋮ A note on 2-factors with two components ⋮ On a Hamiltonian cycle in which specified vertices are uniformly distributed ⋮ Disjoint cycles with partial degree conditions in claw-free graphs ⋮ Existence of two disjoint long cycles in graphs ⋮ Results and problems on chorded cycles: a survey ⋮ 2-proper partition of a graph ⋮ Recent Results on Disjoint Cycles in Graphs
This page was built for publication: Degree conditions for 2-factors
