Partitioning graphs into complete and empty graphs (Q1045126): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.06.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979114268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / 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 some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of Min Split-coloring and Min Cocoloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning cographs into cliques and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On split-coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results in cochromatic and dichromatic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5609148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cocolourings and cochromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning chordal graphs into independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small graphs with chromatic number 5: A computer search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning permutations into increasing and decreasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critical subgraphs of colour-critical graphs / rank
 
Normal rank

Latest revision as of 07:55, 2 July 2024

scientific article
Language Label Description Also known as
English
Partitioning graphs into complete and empty graphs
scientific article

    Statements

    Partitioning graphs into complete and empty graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    (\(j,k\))-coloring
    0 references
    split graph
    0 references
    cocoloring
    0 references
    0 references