Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W264442127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Coloring in the Absence of a Linear Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Vertices of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / 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 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: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank

Latest revision as of 09:27, 4 July 2024

scientific article
Language Label Description Also known as
English
Coloring Graphs without Short Cycles and Long Induced Paths
scientific article

    Statements

    Coloring Graphs without Short Cycles and Long Induced Paths (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2011
    0 references

    Identifiers