Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2023.105015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4322621584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of surjective homomorphism problems-a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring and list three-coloring of graphs without induced paths on seven vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of \(P_k\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-coloring <i>P</i><sub>6</sub>-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monotone Satisfiability Problem with Bounded Variable Appearances / 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: On List Coloring and List Homomorphism of Permutation and Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension problems with degree bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: List matrix partitions of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone monadic SNP and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of \(H\)-colouring of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing complexity gaps for coloring problems on \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-colouring \(P_t\)-free graphs in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / 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: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-homomorphism problems on graphs and arc consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:56, 1 August 2024

scientific article; zbMATH DE number 7687210
Language Label Description Also known as
English
Complexity of \(C_k\)-coloring in hereditary classes of graphs
scientific article; zbMATH DE number 7687210

    Statements

    Complexity of \(C_k\)-coloring in hereditary classes of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2023
    0 references
    graph coloring
    0 references
    homomorphism
    0 references
    computational complexity
    0 references
    hereditary graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers