Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
From MaRDI portal
Publication:1687923
DOI10.1007/978-3-319-68705-6_20zbMath1483.05062OpenAlexW3125848164MaRDI QIDQ1687923
Publication date: 4 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-68705-6_20
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Colouring graphs with no induced six-vertex path or diamond ⋮ Colouring square-free graphs without long induced paths. ⋮ Star coloring of certain graph classes ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ Colouring graphs with no induced six-vertex path or diamond ⋮ A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS ⋮ Colouring square-free graphs without long induced paths
This page was built for publication: Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
