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.076MaRDI QIDQ3439631zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• Distance constrained labelings of \(K_{4}\)-minor free graphs
• Distance labeling schemes for \(K_4\)-free bridged graphs
• Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• A characterization of \(K_{2,4}\)-minor-free graphs
• Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Automata, Languages and Programming
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s

Cites work

• \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
• A bound on the chromatic number of the square of a planar graph
• A Theorem about the Channel Assignment Problem
• Coloring Powers of Chordal Graphs
• Coloring Powers of Planar Graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• Coloring the square of a planar graph
• scientific article; zbMATH DE number 5763155 (Why is no real title available?)
• scientific article; zbMATH DE number 5763163 (Why is no real title available?)
• Labeling Chordal Graphs: Distance Two Condition
• Labelling Graphs with a Condition at Distance 2
• On \(L(d,1)\)-labelings of graphs
• The $L(2,1)$-Labeling Problem on Graphs

Cited in

(2)

• Distance constrained labelings of \(K_{4}\)-minor free graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free 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

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