4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807): Difference between revisions

From MaRDI portal
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W2963082826 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.08911 / 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: Q5387674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-colorability of \(P_6\)-free graphs / 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: Obstructions for three-coloring graphs with one forbidden induced subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Bull-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of bull-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive generation of <i>k</i>‐critical ‐free 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: Constructions of \(k\)-critical \(P_5\)-free graphs / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $3$-Colorable $P_5$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Bull-Free Perfect 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: A new characterization of \(P_{6}\)-free graphs / rank
 
Normal rank

Latest revision as of 10:00, 14 July 2024

scientific article
Language Label Description Also known as
English
4-coloring \((P_6, \text{bull})\)-free graphs
scientific article

    Statements

    4-coloring \((P_6, \text{bull})\)-free graphs (English)
    0 references
    0 references
    0 references
    12 September 2017
    0 references
    coloring
    0 references
    \(P_6\)-free
    0 references
    bull-free
    0 references
    polynomial time
    0 references
    algorithm
    0 references
    0 references
    0 references

    Identifiers