An Algorithmic Approach to Equitable Total Chromatic Number of Graphs

DOI10.4067/S0716-09172017000200307zbMATH Open1390.05075OpenAlexW2731209392MaRDI QIDQ4634467

G. Girija, Veninstine Vivik J.

Publication date: 10 April 2018

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172017000200307

zbMATH Keywords

gearwheelequitable total coloringhelmsunlet

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Improving lower bounds for equitable chromatic number ⋮ Title not available (Why is that?) ⋮ Equitable total chromatic number of splitting graph ⋮ Equitable total coloring of Fibonacci graphs

This page was built for publication: An Algorithmic Approach to Equitable Total Chromatic Number of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634467)