On Computational Aspects of Greedy Partitioning of Graphs (Q4632201): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62043601, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Grundy number of graphs with few \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: New potential functions for greedy independence and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2883161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perfect coloring properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interpolation theorem for partitions which are complete with respect to hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line 3-chromatic graphs. II: Critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on first-fit coloring of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the Grundy chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the chromatic number of graphs / rank
 
Normal rank

Latest revision as of 02:26, 19 July 2024

scientific article; zbMATH DE number 7048098
Language Label Description Also known as
English
On Computational Aspects of Greedy Partitioning of Graphs
scientific article; zbMATH DE number 7048098

    Statements

    On Computational Aspects of Greedy Partitioning of Graphs (English)
    0 references
    0 references
    26 April 2019
    0 references
    graph partitioning
    0 references
    computational complexity
    0 references
    graph coloring
    0 references
    greedy algorithm
    0 references
    Grundy number
    0 references
    minimal graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references