A result on the total colouring of powers of cycles
From MaRDI portal
(Redirected from Publication:875593)
Recommendations
Cites work
- Coloração Total do C²n
- Determining the total colouring number is NP-hard
- On planarity and colorability of circulant graphs
- The Colour Numbers of Complete Graphs
- Total colouring regular bipartite graphs is NP-hard
- Total colourings of graphs
- Total-chromatic number and chromatic index of dually chordal graphs
Cited in
(23)- On star and biclique edge-colorings
- On total chromatic number of direct product graphs
- Total colorings-a survey
- On the AVDTC of Sierpiński-type graphs
- Total chromatic number of unichord-free graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
- Total colorings of circulant graphs
- A proof of a conjecture on multiset coloring the powers of cycles
- On the conformability of regular line graphs
- THE HULL NUMBER OF POWERS OF CYCLES
- Computing square roots of trivially perfect and threshold graphs
- On total coloring of some classes of regular graphs
- The hunting of a snark with total chromatic number 5
- Colouring clique-hypergraphs of circulant graphs
- Colouring clique-hypergraphs of circulant graphs
- Equitable total coloring of \(C_m\square C_n\)
- Results about the total chromatic number and the conformability of some families of circulant graphs
- An optimal algorithm to totally color some powers of cycle graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Partitioning a graph into convex sets
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- Even-power of cycles with many vertices are type 1 total colorable
This page was built for publication: A result on the total colouring of powers of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875593)