Two cases of polynomial-time solvability for the coloring problem (Q5963654): 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.1007/s10878-014-9792-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124367257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring vertices of triangle-free graphs without forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring of graphs with Ramsey-type forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Coloring in the Absence of Two Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / 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: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary properties of graphs for algorithmic graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and recognition of circular-arc graphs and subclasses: a survey / 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: Some new hereditary classes where graph coloring remains NP-hard / 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: Q5263782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coloring problem for classes with two small obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:02, 11 July 2024

scientific article; zbMATH DE number 6544342
Language Label Description Also known as
English
Two cases of polynomial-time solvability for the coloring problem
scientific article; zbMATH DE number 6544342

    Statements

    Two cases of polynomial-time solvability for the coloring problem (English)
    0 references
    23 February 2016
    0 references
    vertex coloring
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references

    Identifiers