On coloring a class of claw-free graphs. (Q2132368): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2019.08.033 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q113317399 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2978207776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coloring algorithm for \(4 K_1\)-free line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Color Claw-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coloring of graphs with few obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2019.08.033 / rank
 
Normal rank

Latest revision as of 04:30, 17 December 2024

scientific article
Language Label Description Also known as
English
On coloring a class of claw-free graphs.
scientific article

    Statements

    On coloring a class of claw-free graphs. (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2022
    0 references
    graph coloring
    0 references
    line-graph
    0 references
    \textit{claw}
    0 references
    hole-twin
    0 references
    \(C_6\)-\textit{twin}
    0 references
    \(C_5\)-\textit{twin}
    0 references
    \(C_4\)-\textit{twin}
    0 references
    \(P_5\)-twin
    0 references

    Identifiers