Complexity separating classes for edge-colouring and total-colouring
From MaRDI portal
Publication:2391946
Recommendations
- Complexity-separating graph classes for vertex, edge and total colouring
- Total chromatic number of \{square,unichord\}-free graphs
- Total chromatic number of unichord-free graphs
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Clique-colouring and biclique-colouring unichord-free graphs
Cites work
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Chromatic index of graphs with no cycle with a unique chord
- Edge-colouring and total-colouring chordless graphs
- List edge and list total colourings of multigraphs
- NP completeness of finding the chromatic index of regular graphs
- The NP-completeness column: an ongoing guide
- The total chromatic number of some bipartite graphs.
- Total chromatic number of \{square,unichord\}-free graphs
- Total chromatic number of unichord-free graphs
- Total colouring regular bipartite graphs is NP-hard
- Total colourings of graphs
Cited in
(9)- Complexity-separating graph classes for vertex, edge and total colouring
- Total colorings-a survey
- Total chromatic number of \{square,unichord\}-free graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Clique-colouring and biclique-colouring unichord-free graphs
- Two complexity results for the vertex coloring problem
- Total chromatic number of unichord-free graphs
This page was built for publication: Complexity separating classes for edge-colouring and total-colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391946)