Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free graphs and forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Complexity Results on Coloring P k -Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the complexity status of coloring graphs without a fixed induced linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Certifying Algorithm for 3-Colorability of P 5-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Vertices of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring problems on dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of 4-coloring graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank

Latest revision as of 05:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
scientific article

    Statements

    Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    chromatic number
    0 references
    triangle-free
    0 references
    forbidden induced subgraph
    0 references
    0 references