Fan-type condition on disjoint cycles in a graph (Q1699571): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense 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: On circuits in graphs / 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: New sufficient conditions for cycles in 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: Q3826605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs containing every 2-factor / 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: On the maximum number of independent cycles 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: Disjoint triangles and quadrilaterals in a graph / rank
 
Normal rank

Latest revision as of 05:01, 15 July 2024

scientific article
Language Label Description Also known as
English
Fan-type condition on disjoint cycles in a graph
scientific article

    Statements

    Identifiers