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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-017-1873-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: cyclechord / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-017-1873-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2789747582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of a bipartite Hamiltonian graph into two cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclability in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent cycles and edges in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles with chords in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of graphs into cycles with chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for decomposing graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudo 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Haeggkvist on cycles and independent edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for long circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results on judicious partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on two sufficient conditions for Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of independent cycles in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence trees and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles through prescribed vertices have the Erdős‐Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree thresholds for bipartite graph tiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with \(k\) components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified vertices in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in 2-factors of balanced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Chorded Cycles of the Same Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors containing 1-factors in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Erdős condition and 2-factors with a specyfied number of components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with a cycle of length divisible by three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sums and path-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering vertices by a specified number of disjoint cycles, edges and isolated vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a sharp degree sum condition for disjoint chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for vertex-disjoint even cycles in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of vertex-disjoint subgraphs with high degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum conditions for vertex-disjoint cycles passing through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enomoto and Ota's conjecture holds for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chorded cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for disconnected minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results Concerning the Structure of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs with girth at least five under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cycles and 2-factor passing through any given vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles of the same length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two‐factors each component of which contains a specified vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of two disjoint long cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for <i>H</i>‐linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering vertices of a graph by \(k\) disjoint cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions without isolated vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partition problems into cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of a graph into cycles and degenerated cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of a graph into paths with prescribed endvertices and lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise location of vertices on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, degrees and 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 2-factors with two components / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Ore-Type Conditions for H-Linked Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing degree-sum maximal nonhamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent chorded cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3025202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for the partition of a graph into cycles, edges and isolated vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2881274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex cover with chorded 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood unions for the existence of disjoint chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with cycles containing specified vertices in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independet cycles and chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent doubly chorded cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-disjoint cycles and degree sum conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply Chorded Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Degree Implying That a Graph is H‐Linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision extendibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of diagonals of a circuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of graphs with condition on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Enomoto and Ota's conjecture for short paths in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing disjoint cycles over vertex cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of Given Size in a Dense Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak cycle partition involving degree sum conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles of length at most four each of which contains a specified vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex‐disjoint cycles containing prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem on cycles containing specified independent edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degree conditions and cycle coverings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in graphs with distance degree sum conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An El-Zah�r type condition ensuring path-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of triangle-free graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a 2-factor with a specified edge in a graph satisfying the Ore condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree, independence number and regular factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of theorems on vertex-disjoint chorded cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partition into paths containing specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening Theorems of Dirac and Erdős on Disjoint Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Corrádi-Hajnal theorem and a question of Dirac / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling Turán theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type graph packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore‐type degree conditions for a graph to be <i>H</i>‐linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for \(H\)-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type conditions implying 2-factors consisting of short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs containing every 2-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on K-path hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs with high minimum degree or connectivity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum degree threshold for perfect graph packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type Theorem for Perfect Packings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5319255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition of 2-factors in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type degree conditions for disjoint path covers in simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the circumference of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartition of graph under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The confirmation of a conjecture on disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic version of a conjecture by Enomoto and Ota / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into paths or cycles of prescribed lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic multipartite version of the Alon-Yuster theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of a graph into cycles containing a specified linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum conditions for path-factors with specified end vertices in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3371005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint 4-cycles containing specified edges in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles intersecting a set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood unions and disjoint chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint chorded cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing a sparse minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal–Erdős Theorem: Old Theorem with New Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Mader's \(\mathcal S\)-paths theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear edge bound for graph linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with applications to subdivisions and path systems modulo <i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the presence of disjoint subgraphs of a specified type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles of the same length. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent cycles with limited size in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a graph with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two vertex-disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a graph with cycles passing through given edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint hexagons with chords in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of independent cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on cycles in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-disjoint complete bipartite subgraphs in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large vertex-disjoint cycles in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal total length of \(k\) disjoint cycles in bitpartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint triangles and quadrilaterals in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Erdős-Faudree conjecture on quadrilaterals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint 5-cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint long cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Degree Conditions and Cycle Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degree sum conditions for long cycles and cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint triangles and quadrilaterals in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Enomoto's problems in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with prescribed properties in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with cycles containing specified edges in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fan-type condition on disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Cycles Through Specified Edges in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for the partition of a graph into triangles and quadrilaterals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified vertices in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Graph Tiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles of order eight with chords in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type conditions for bipartite graphs containing hexagons / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-017-1873-5 / rank
 
Normal rank

Latest revision as of 05:10, 11 December 2024

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

    Statements

    Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (English)
    0 references
    0 references
    0 references
    22 March 2018
    0 references
    packing
    0 references
    partitioning
    0 references
    cycles
    0 references
    paths
    0 references
    degree conditions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers