On the complexity of 4-coloring graphs without long induced paths (Q2465649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.tcs.2007.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160153943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free 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 Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs with no \(P_ 5\) and no \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-colourability and forbidden subgraphs. II: Polynomial algorithms / 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: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:45, 27 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of 4-coloring graphs without long induced paths
scientific article

    Statements

    On the complexity of 4-coloring graphs without long induced paths (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    \(P_{5}\)-free graph
    0 references
    computational complexity
    0 references
    induced path
    0 references
    0 references