Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420)

scientific article; zbMATH DE number 6852061

Language	Label	Description	Also known as
English	Degree conditions for the existence of vertex-disjoint cycles and paths: a survey	scientific article; zbMATH DE number 6852061

Statements

instance of

scholarly article

0 references

title

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (English)

0 references

0 references

0 references

Graphs and Combinatorics

0 references

publication date

22 March 2018

0 references

zbMATH Keywords

packing

0 references

partitioning

0 references

cycles

0 references

paths

0 references

degree conditions

0 references

describes a project that uses

cyclechord

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s00373-017-1873-5

0 references

cites work

Q3921268

0 references

Embedding Arbitrary Graphs of Maximum Degree Two

0 references

Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees

0 references

The extremal question for cycles with chords

0 references

Disjoint directed cycles

0 references

2-factors in dense graphs

0 references

$H$-factors in dense graphs

0 references

Partition of a bipartite Hamiltonian graph into two cycles

0 references

Cyclability in bipartite graphs

0 references

On independent cycles and edges in graphs

0 references

Disjoint cycles with chords in graphs

0 references

Decompositions of graphs into cycles with chords

0 references

Decomposing Weighted Graphs

0 references

Q3565858

0 references

Efficient algorithms for decomposing graphs under degree constraints

0 references

On pseudo 2-factors

0 references

Proof of a conjecture of Haeggkvist on cycles and independent edges

0 references

Q4094891

0 references

Cycles in digraphs– a survey

0 references

Disjoint chorded cycles in graphs

0 references

The Erdős-Pósa property for long circuits

0 references

Cycles through specified vertices

0 references

Packings of graphs and applications to computational complexity

0 references

Problems and results on judicious partitions

0 references

A remark on two sufficient conditions for Hamilton cycles

0 references

On the maximum number of independent cycles in a bipartite graph

0 references

Degree conditions for 2-factors

0 references

Independence trees and Hamilton cycles

0 references

Long cycles through prescribed vertices have the Erdős‐Pósa property

0 references

Minimum degree thresholds for bipartite graph tiling

0 references

On 2-factors with $k$ components

0 references

Vertex-disjoint cycles containing specified edges in a bipartite graph

0 references

Vertex-disjoint cycles containing specified vertices in a bipartite graph

0 references

Cycles in 2-factors of balanced bipartite graphs

0 references

Disjoint Chorded Cycles of the Same Length

0 references

On 2-factors containing 1-factors in bipartite graphs

0 references

Chvátal Erdős condition and 2-factors with a specyfied number of components

0 references

Graphs with a cycle of length divisible by three

0 references

Degree sums and path-factors in graphs

0 references

On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles

0 references

Q3565870

0 references

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices

0 references

On a sharp degree sum condition for disjoint chorded cycles in graphs

0 references

Minimum degree conditions for vertex-disjoint even cycles in large graphs

0 references

On the existence of vertex-disjoint subgraphs with high degree sum

0 references

Q5393539

0 references

Q2936733

0 references

A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs

0 references

On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs

0 references

Degree sum conditions for vertex-disjoint cycles passing through specified vertices

0 references

A note on Hamiltonian circuits

0 references

Enomoto and Ota's conjecture holds for large graphs

0 references

On the maximal number of independent circuits in a graph

0 references

Chorded cycles

0 references

Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three

0 references

The extremal function for disconnected minors

0 references

2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees

0 references

Improved degree conditions for 2-factors with $k$ cycles in Hamiltonian graphs

0 references

Q3586724

0 references

Some Theorems on Abstract Graphs

0 references

On the maximal number of independent triangles in graphs

0 references

Some Results Concerning the Structure of Graphs

0 references

On the maximal number of independent circuits in a graph

0 references

Decomposing graphs with girth at least five under degree constraints

0 references

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

0 references

An improved Fan-type degree condition for $k$-linked graphs.

0 references

Vertex-disjoint cycles of the same length

0 references

Two‐factors each component of which contains a specified vertex

0 references

Vertex-disjoint cycles containing specified edges

0 references

Existence of two disjoint long cycles in graphs

0 references

An extremal problem for H‐linked graphs

0 references

Covering vertices of a graph by $k$ disjoint cycles

0 references

Q5461450

0 references

On circuits in graphs

0 references

Graph decompositions without isolated vertices

0 references

On the existence of disjoint cycles in a graph

0 references

Graph partition problems into cycles and paths

0 references

Partition of a graph into cycles and degenerated cycles

0 references

Q3011702

0 references

Partitions of a graph into paths with prescribed endvertices and lengths

0 references

On maximal paths and circuits of graphs

0 references

Q5342984

0 references

On Independent Circuits Contained in a Graph

0 references

New sufficient conditions for cycles in graphs

0 references

Hamiltonian square-paths

0 references

Q5492569

0 references

Precise location of vertices on Hamiltonian cycles

0 references

Toughness, degrees and 2-factors

0 references

A note on 2-factors with two components

0 references

New Ore-type conditions for $H$-linked graphs

0 references

On $H$-linked graphs

0 references

Characterizing degree-sum maximal nonhamiltonian bipartite graphs

0 references

Q3145802

0 references

On the number of independent chorded cycles in a graph

0 references

Q3025202

0 references

Q4659596

0 references

Degree conditions for the partition of a graph into cycles, edges and isolated vertices

0 references

Q5480718

0 references

Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

0 references

On the maximum number of disjoint chorded cycles in graphs.

0 references

A vertex cover with chorded 4-cycles

0 references

Neighborhood unions for the existence of disjoint chorded cycles in graphs

0 references

On 2-factors with cycles containing specified vertices in a bipartite graph

0 references

Independet cycles and chorded cycles in graphs

0 references

On independent doubly chorded cycles

0 references

On vertex-disjoint cycles and degree sum conditions

0 references

Multiply Chorded Cycles

0 references

On Minimum Degree Implying That a Graph is H‐Linked

0 references

Q3428647

0 references

Subdivision extendibility

0 references

On the maximum number of diagonals of a circuit in a graph

0 references

Q3708045

0 references

Q5620621

0 references

Partition of graphs with condition on the connectivity and minimum degree

0 references

Note on Enomoto and Ota's conjecture for short paths in large graphs

0 references

Packing disjoint cycles over vertex cuts

0 references

Cycles of Given Size in a Dense Graph

0 references

Q3118103

0 references

Weak cycle partition involving degree sum conditions

0 references

Vertex-disjoint cycles of length at most four each of which contains a specified vertex

0 references

Vertex‐disjoint cycles containing prescribed vertices

0 references

An extension of a theorem on cycles containing specified independent edges

0 references

Partial degree conditions and cycle coverings in bipartite graphs

0 references

Disjoint cycles in graphs with distance degree sum conditions

0 references

An El-Zah�r type condition ensuring path-factors

0 references

On Maximal Circuits in Finite Graphs

0 references

Q3826605

0 references

Packing cycles through prescribed vertices

0 references

On decomposition of triangle-free graphs under degree constraints

0 references

On a 2-factor with a specified edge in a graph satisfying the Ore condition

0 references

A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition

0 references

Minimum degree, independence number and regular factors

0 references

Q5466086

0 references

On the Computational Complexity of Combinatorial Problems

0 references

A refinement of theorems on vertex-disjoint chorded cycles

0 references

Graph partition into paths containing specified vertices

0 references

K4−‐factor in a graph

0 references

On Sufficient Degree Conditions for a Graph to be $k$-linked

0 references

An Ore-type theorem on equitable coloring

0 references

Strengthening Theorems of Dirac and Erdős on Disjoint Cycles

0 references

On the Corrádi-Hajnal theorem and a question of Dirac

0 references

The $(2k-1)$-connected multigraphs with at most $k-1$ disjoint cycles

0 references

Q3656238

0 references

Tiling Turán theorems

0 references

Proof of the Alon-Yuster conjecture

0 references

Proof of the Seymour conjecture for large graphs

0 references

Ore-type graph packing problems

0 references

Ore‐type degree conditions for a graph to be H‐linked

0 references

Minimum degree conditions for $H$-linked graphs

0 references

Ore-type conditions implying 2-factors consisting of short cycles

0 references

Graphs containing every 2-factor

0 references

A note on K-path hamiltonian graphs

0 references

Partitions of graphs with high minimum degree or connectivity.

0 references

The minimum degree threshold for perfect graph packings

0 references

An Ore-type Theorem for Perfect Packings in Graphs

0 references

On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

0 references

A Fan-type degree condition for $k$-linked graphs

0 references

Q5319255

0 references

Partitioning a graph into vertex-disjoint paths

0 references

Q5310215

0 references

A degree condition of 2-factors in bipartite graphs

0 references

Q5463524

0 references

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

0 references

Ore-type degree conditions for disjoint path covers in simple graphs

0 references

A lower bound for the circumference of a graph

0 references

Bipartition of graph under degree constraints

0 references

Q5530472

0 references

A homology theory for spanning tress of a graph

0 references

Matroid matching and some applications

0 references

Q4276003

0 references

The confirmation of a conjecture on disjoint cycles in a graph

0 references

Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

0 references

An asymptotic version of a conjecture by Enomoto and Ota

0 references

Partitioning graphs into paths or cycles of prescribed lengths

0 references

Asymptotic multipartite version of the Alon-Yuster theorem

0 references

Q5477449

0 references

Partitions of a graph into cycles containing a specified linear forest

0 references

Degree sum conditions for path-factors with specified end vertices in bipartite graphs

0 references

Q3371005

0 references

Vertex-disjoint 4-cycles containing specified edges in a bipartite graph

0 references

Q3428673

0 references

On Hamiltonian bipartite graphs

0 references

Note on Hamilton Circuits

0 references

Hamilton connected graphs

0 references

Disjoint cycles intersecting a set of vertices

0 references

Neighborhood unions and disjoint chorded cycles in graphs

0 references

Vertex-disjoint chorded cycles in a graph

0 references

Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs

0 references

Q5403028

0 references

Forcing a sparse minor

0 references

Chvátal–Erdős Theorem: Old Theorem with New Aspects

0 references

Edge disjoint placement of graphs

0 references

Q3699724

0 references

A short proof of Mader's $\mathcal S$-paths theorem

0 references

2‐neighborhoods and hamiltonian conditions

0 references

Q4715286

0 references

An improved linear edge bound for graph linkages

0 references

Nonseparating cycles inK-Connected graphs

0 references

Disjoint cycles in digraphs

0 references

Girth in graphs

0 references

Graph decomposition with constraints on the connectivity and minimum degree

0 references

Graph decomposition with applications to subdivisions and path systems modulo k

0 references

On the presence of disjoint subgraphs of a specified type

0 references

Q3808121

0 references

The Factors of Graphs

0 references

Vertex-disjoint cycles of the same length.

0 references

Independent cycles with limited size in a graph

0 references

Covering a graph with cycles

0 references

Two vertex-disjoint cycles in a graph

0 references

Covering a graph with cycles passing through given edges

0 references

Vertex-disjoint hexagons with chords in a bipartite graph

0 references

On the maximum number of independent cycles in a graph

0 references

On 2-factors of a bipartite graph

0 references

Proof of a conjecture on cycles in a bipartite graph

0 references

On vertex-disjoint complete bipartite subgraphs in a bipartite graph

0 references

Large vertex-disjoint cycles in a bipartite graph

0 references

On quadrilaterals and cycle covers in a bipartite graph.

0 references

Maximal total length of $k$ disjoint cycles in bitpartite graphs

0 references

Disjoint triangles and quadrilaterals in a graph

0 references

Proof of the Erdős-Faudree conjecture on quadrilaterals

0 references

An extension of the Corrádi-Hajnal theorem

0 references

Disjoint 5-cycles in a graph

0 references

Disjoint long cycles in a graph

0 references

DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS

0 references

Partial Degree Conditions and Cycle Coverings

0 references

Sufficient Conditions for Circuits in Graphs†

0 references

On degree sum conditions for long cycles and cycles through specified vertices

0 references

Disjoint triangles and quadrilaterals in a graph

0 references

On Enomoto's problems in a bipartite graph

0 references

On 2-factors with prescribed properties in a bipartite graph

0 references

Q5310245

0 references

On 2-factors with cycles containing specified edges in a bipartite graph

0 references

Fan-type condition on disjoint cycles in a graph

0 references

Spanning cycles through specified edges in bipartite graphs

0 references

Degree conditions for the partition of a graph into triangles and guadrilaterals

0 references

Vertex-disjoint cycles containing specified vertices in a bipartite graph

0 references

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs

0 references

Bipartite Graph Tiling

0 references

Vertex-disjoint cycles of order eight with chords in a bipartite graph

0 references

Ore-type conditions for bipartite graphs containing hexagons

0 references

Identifiers

zbMATH Open document ID

1382.05017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S00373-017-1873-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1706420