Pages that link to "Item:Q848637"
From MaRDI portal
The following pages link to Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Data reduction for graph coloring problems (Q393081) (← 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)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← 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)
- List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\) (Q2198407) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Coloring of pseudocubic graphs in three colors (Q2287152) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
