On irreducible no‐hole L(2, 1)‐coloring of trees

DOI10.1002/net.20286zbMath1167.05026OpenAlexW4246358091MaRDI QIDQ5191141

Gretchen L. Matthews, Beth Novick, John Villalpando, Renu C. Laskar

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20286

zbMATH Keywords

treechannel assignment problemirreducible coloring\(L(\)2,1)-coloring

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Coloring of graphs and hypergraphs (05C15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (9)

Solutions of some \(L(2, 1)\)-coloring related open problems ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph ⋮ Infinitely many trees with maximum number of holes zero, one, and two ⋮ On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs ⋮ On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths

Cites Work

• Unnamed Item
• No-hole \((r+1)\)-distant colorings
• Acyclic colorings of products of trees
• No-hole 2-distant colorings
• Distance-two labelings of graphs
• A survey on labeling graphs with a condition at distance two
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• Channel assignment and weighted coloring
• An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs

This page was built for publication: On irreducible no‐hole L(2, 1)‐coloring of trees