Rainbow degree-jump coloring of graphs

DOI10.15330/cmp.13.1.229-239zbMath1468.05082OpenAlexW3215095443WikidataQ114007025 ScholiaQ114007025MaRDI QIDQ5006774

Sudev Naduvath, Eunice Mphako-Banda, Johan Kok

Publication date: 17 August 2021

Published in: Carpathian Mathematical Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15330/cmp.13.1.229-239

zbMATH Keywords

Moore boundblind vertexMphako graphrainbow degree-jump chromatic numberrainbow degree-jump coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs ⋮ On equitable near-proper coloring of some derived graph classes

This page was built for publication: Rainbow degree-jump coloring of graphs