Coloring (gem, co‐gem)‐free graphs

DOI10.1002/jgt.22251zbMath1407.05095OpenAlexW2797379928MaRDI QIDQ4646937

T. Karthick, Frédéric Maffray

Publication date: 3 January 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22251

zbMATH Keywords

chromatic number\(\chi\)-boundednessclique size

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Colouring graphs with no induced six-vertex path or diamond ⋮ Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs ⋮ A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs ⋮ Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs ⋮ Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ On rectangle intersection graphs with stab number at most two ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ Colouring graphs with no induced six-vertex path or diamond

This page was built for publication: Coloring (gem, co‐gem)‐free graphs