Pages that link to "Item:Q2978179"
From MaRDI portal
The following pages link to A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179):
Displaying 25 items.
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (Q5099103) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- (Q5874489) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
