28 citations · 47 across the 33 of their papers we have counts for
35 papers
Face -colorings and Petrie monochromatic circuits for efficient total arc colorings of cubic maps of girth 4
Italo J Dejter
Let be a finite connected simple cubic graph. A total coloring is efficient if each color yields an efficient dominating se…
List and total colorings of multiset permutation graphs
Italo J. Dejter
Let and be positive integers. The multiset star transposition graph ST has as vertices the -strings on symbols, each symbol r…
Efficient total face coloring of planar and toroidal maps
Italo J. Dejter
Let . A total coloring of a simple connected regular graph via the color set is said to be {\it efficient} if each color yields an efficie…
From semi-total to equitable total colorings, and their induced partitions into perfect and total perfect codes
I. J. Dejter
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a connected simple graph is either or , wher…
Total coloring of regular graphs of girth = degree + 1
Italo J. Dejter
Let . A total coloring of a -regular simple graph via colors is an {\it efficient total coloring} if each color yields an efficient dominating set, wh…
An alternate form of Merino-Mička-Mütze's approach to a combinatorial generation problem of Knuth
Italo J. Dejter
A modification of Merino-Mička-Mütze's solution to a combinatorial generation problem of Knuth is proposed in this survey. The resulting alternate form to such solution is compatib…