Pages that link to "Item:Q417995"
From MaRDI portal
The following pages link to Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995):
Displaying 9 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model (Q6148078) (← links)
