scientific article; zbMATH DE number 844150

MaRDI QIDQ4865135zbMATH OpenFDO

Authors Denise Sakai Troxell

Publication date 26 August 1996

zbMATH Keywords

2-distant coloring\(N\)-coloring\(T\)-coloringchromatic numberHamiltonian completion numberholeNP-hardpath-covering number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• No-hole 2-distant colorings
• Minimum span of no-hole (r+1)-distant colorings
• No-hole (r+1)-distant colorings
• Holes in L(2,1)-coloring on certain classes of graphs
• Further results on 2-distance coloring of graphs
• 2-distance colorings of integer distance graphs
• 2-distance coloring of sparse graphs
• 2-distance coloring of sparse graphs
• Distance-two coloring of sparse graphs
• Minimum 2-distance coloring of planar graphs and channel assignment

Cited in

(5)

• Distance-two labellings of Hamming graphs
• No-hole 2-distant colorings
• No-hole k-tuple (r+1)-distant colorings
• Extremal problems on consecutive \(L(2,1)\)-labelling
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups

This page was built for publication:

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