Extremal numbers for disjoint copies of a clique (Q6202950): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Equitable coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for two vertex-disjoint copies of a clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extremal problem in graph theory. / 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: Generalized Turán results for intersecting cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equitable coloring of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5546739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Turán number of two disjoint cliques / rank
 
Normal rank

Revision as of 13:45, 27 August 2024

scientific article; zbMATH DE number 7809939
Language Label Description Also known as
English
Extremal numbers for disjoint copies of a clique
scientific article; zbMATH DE number 7809939

    Statements

    Identifiers