From the 1 of 9 linked papers with an AI index.
9 papers
Periodic efficient total girth colorings in cubic maps of girth 4 correspond to 3-permutation face colorings
Italo J Dejter
The paper studies a special kind of coloring for cubic graph maps of girth 4 on orientable surfaces, showing that when such colorings exist they correspond exactly to 3‑permutation…
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
I. J. Dejter
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph is either or , wh…
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…
Total coloring and efficient domination applications to non-Cayley non-Schreier vertex-transitive graphs
Italo J. Dejter
Let . Let the star 2-set transposition graph be the -regular graph whose vertices are the -strings on symbols, each symbol repeated twice…
Tight factorizations of girth--regular graphs
Italo J. Dejter
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. A…