Some maximum multigraphs and adge/vertex distance colourings

DOI10.7151/dmgt.1010zbMath0833.05036OpenAlexW2114547177MaRDI QIDQ4846689

Zdzisław Skupień

Publication date: 5 March 1996

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1010

zbMATH Keywords

multigraphhypercubecyclesline graphchromatic numbertreeschromatic indexdistance colouringsmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

\(r\)-strong edge colorings of graphs ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ On the strong chromatic index of cyclic multigraphs ⋮ New results on two hypercube coloring problems ⋮ Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ Distance edge-colourings and matchings ⋮ The distance coloring of graphs ⋮ Vertex colorings with a distance restriction

This page was built for publication: Some maximum multigraphs and adge/vertex distance colourings