Pages that link to "Item:Q643026"
From MaRDI portal
The following pages link to Total chromatic number of unichord-free graphs (Q643026):
Displaying 7 items.
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
