Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint chorded cycles in graphs / 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: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / 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: <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint copies of K<sub>4</sub><sup>-</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / 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: Proof of the Erdős-Faudree conjecture on quadrilaterals / rank
 
Normal rank

Latest revision as of 12:04, 7 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree conditions for vertex-disjoint even cycles in large graphs
scientific article

    Statements

    Identifiers