Pages that link to "Item:Q1889838"
From MaRDI portal
The following pages link to Vertex colouring and forbidden subgraphs -- a survey (Q1889838):
Displaying 50 items.
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- Star chromatic bounds (Q327688) (← links)
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Excluding the fork and antifork (Q2305900) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← 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)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
