Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs

DOI10.1016/j.endm.2007.01.076zbMath1293.05340DBLPjournals/endm/KralN07OpenAlexW2180123638WikidataQ57601508 ScholiaQ57601508MaRDI QIDQ3439631

Pavel Nejedlý, Daniel Král'

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.076

zbMATH Keywords

series-parallel graphs\(K_{4}\)-minor free graphs\(L(pq)\)-labelings

Mathematics Subject Classification ID

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

Cites Work

• 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
• 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
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• Coloring Powers of Chordal Graphs

This page was built for publication: Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs