Pages that link to "Item:Q1422435"
From MaRDI portal
The following pages link to 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435):
Displaying 17 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- On the chromatic number of a graph with two forbidden subgraphs (Q1122586) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Forbidden triples generating a finite set of graphs with minimum degree three (Q2166238) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- 3-colourability and forbidden subgraphs (Q2816134) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
