Minimum Span of No-Hole (r+1)-Distant Colorings

DOI10.1137/S0895480198339456zbMath0986.05087MaRDI QIDQ2753531

Daphne Der-Fen Liu, Justie Su-Tzu Juan, Gerard Jennhwa Chang

Publication date: 11 November 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsvertex coloringminimum spanno-hole \((r+1)\)-distant coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Extremal problems on consecutive \(L(2,1)\)-labelling, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Channel assignment problem and relaxed 2-distant coloring of graphs, Distance-two labellings of Hamming graphs