Minimum order of graphs with given coloring parameters (Q488290): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/dm/BacsoBHT15, #quickstatements; #temporary_batch_1731462974821
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1312.7522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grundy number and products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pseudoachromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2883161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Achromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perfect coloring properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of harmonious colouring for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the achromatic number / 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: Q5578801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Grundy Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph with given achromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line coloring \(k\)-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating the Achromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for 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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/BacsoBHT15 / rank
 
Normal rank

Latest revision as of 03:02, 13 November 2024

scientific article
Language Label Description Also known as
English
Minimum order of graphs with given coloring parameters
scientific article

    Statements

    Minimum order of graphs with given coloring parameters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    graph coloring
    0 references
    Grundy number
    0 references
    achromatic number
    0 references
    greedy algorithm
    0 references
    extremal graph
    0 references
    bipartite graph
    0 references

    Identifiers