Pages that link to "Item:Q5110670"
From MaRDI portal
The following pages link to The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness (Q5110670):
Displaying 15 items.
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5920066) (← links)
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
