Graph partition into \(K_{3}\)s and \(K_{4}\)s (Q711522): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for 2-factors / 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 the maximal number of independent triangles in graphs / 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: Disjoint triangles and quadrilaterals in a graph / rank
 
Normal rank

Latest revision as of 09:41, 3 July 2024

scientific article
Language Label Description Also known as
English
Graph partition into \(K_{3}\)s and \(K_{4}\)s
scientific article

    Statements

    Graph partition into \(K_{3}\)s and \(K_{4}\)s (English)
    0 references
    0 references
    0 references
    26 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    graph
    0 references
    degree condition
    0 references
    vertex disjoint
    0 references
    cycle
    0 references
    0 references