Colouring H-free graphs of bounded diameter. (Q5092372): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Colouring H-free graphs of bounded diameter.
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.MFCS.2019.14 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3142409 / 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: Hard coloring problems in low degree planar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List 3-coloring graphs with no induced \(P_6 + rP_3\) / 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: Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677530 / 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: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth / 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: \(H\)-colouring \(P_t\)-free graphs in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / 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: On Moore Graphs with Diameters 2 and 3 / 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: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring (P_r+P_s)-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and almost tight results for 3-colorability of small diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs when the number of colours is almost the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems on Graph Coloring for Special Graph Classes / 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: There is No Irregular Moore Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2019.14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2968066320 / rank
 
Normal rank
Property / title
 
Colouring H-free graphs of bounded diameter. (English)
Property / title: Colouring H-free graphs of bounded diameter. (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2019.14 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561658
Language Label Description Also known as
English
Colouring H-free graphs of bounded diameter.
scientific article; zbMATH DE number 7561658

    Statements

    0 references
    0 references
    0 references
    21 July 2022
    0 references
    vertex colouring
    0 references
    \(H\)-free graph
    0 references
    diameter
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Colouring H-free graphs of bounded diameter. (English)
    0 references

    Identifiers