Pages that link to "Item:Q1427186"
From MaRDI portal
The following pages link to 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186):
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)
- 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)
- 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)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← 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)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- Membrane computing to enhance time efficiency of minimum dominating set (Q2630783) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
