Pages that link to "Item:Q875593"

The following pages link to A result on the total colouring of powers of cycles (Q875593):

Displaying 19 items.

• Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
• Total chromatic number of unichord-free graphs (Q643026) (← links)
• On total chromatic number of direct product graphs (Q980443) (← links)
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
• Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
• Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
• On total coloring of some classes of regular graphs (Q2167796) (← links)
• Partitioning a graph into convex sets (Q2275456) (← links)
• Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
• The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
• On star and biclique edge-colorings (Q2968507) (← links)
• Total colorings of circulant graphs (Q5025120) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
• Results about the total chromatic number and the conformability of some families of circulant graphs (Q6094719) (← links)
• On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)
• On the conformability of regular line graphs (Q6181221) (← links)