Distance constrained labelings of \(K_{4}\)-minor free graphs

DOI10.1016/j.disc.2008.05.022zbMath1226.05217OpenAlexW2149756254WikidataQ57601459 ScholiaQ57601459MaRDI QIDQ1045067

Daniel Král', Pavel Nejedlý

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.022

zbMATH Keywords

series-parallel graphdistance constrained labeling\(K_{4}\)-minor free graph

Mathematics Subject Classification ID

Graph minors (05C83) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• On \(L(d,1)\)-labelings of graphs
• An exact algorithm for the channel assignment problem
• On the span in channel assignment problems: Bounds, computing and counting
• Labeling planar graphs with a condition at distance two
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Coloring Powers of Planar Graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• Coloring Powers of Chordal Graphs
• Fixed-parameter complexity of \(\lambda\)-labelings