Pages that link to "Item:Q5232134"
From MaRDI portal
The following pages link to Square-Free Graphs with No Six-Vertex Induced Path (Q5232134):
Displaying 19 items.
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs (Q1687923) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs (Q6143379) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
- Graphs obtained by disjoint unions and joins of cliques and stable sets (Q6594038) (← links)
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← links)
