Pages that link to "Item:Q496654"
From MaRDI portal
The following pages link to Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654):
Displaying 15 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- Requiring that minimal separators induce complete multipartite subgraphs (Q1692647) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Characterizing atoms that result from decomposition by clique separators (Q2364081) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- Total chromatic number of \{square,unichord\}-free graphs (Q2883635) (← links)
- (Q3115020) (← links)
- (Q3766875) (← links)
- Characterizing k-chordal unichord-free graphs (Q4577849) (← links)