Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jco/Borowiecki18, #quickstatements; #temporary_batch_1731475607626
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CriticalPfreeGraphs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0185-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767308712 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59610242 / rank
 
Normal rank
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: On-line P-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computational Aspects of Greedy Partitioning of Graphs / 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: Graph Classes: A Survey / 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: Obstructions for three-coloring graphs with one forbidden induced subgraph / 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: Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071280 / 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: Constructions of \(k\)-critical \(P_5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-fit coloring of bounded tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (O,P)-partition problems / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the chromatic number of a graph / 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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jco/Borowiecki18 / rank
 
Normal rank

Latest revision as of 06:45, 13 November 2024

scientific article
Language Label Description Also known as
English
Computational aspects of greedy partitioning of graphs
scientific article

    Statements

    Computational aspects of greedy partitioning of graphs (English)
    0 references
    0 references
    1 March 2018
    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