Distance constrained labelings of K₄-minor free graphs

DOI10.1016/J.DISC.2008.05.022MaRDI QIDQ1045067zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• 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
• 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
• An exact algorithm for 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
• Fixed-parameter complexity of \(\lambda\)-labelings
• scientific article; zbMATH DE number 5763163 (Why is no real title available?)
• scientific article; zbMATH DE number 5764899 (Why is no real title available?)
• scientific article; zbMATH DE number 1947436 (Why is no real title available?)
• scientific article; zbMATH DE number 1500531 (Why is no real title available?)
• scientific article; zbMATH DE number 1759423 (Why is no real title available?)
• scientific article; zbMATH DE number 1445362 (Why is no real title available?)
• Labeling Chordal Graphs: Distance Two Condition
• Labeling planar graphs with a condition at distance two
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labelling Graphs with a Condition at Distance 2
• On \(L(d,1)\)-labelings of graphs
• On powers of chordal graphs and their colorings
• On the span in channel assignment problems: Bounds, computing and counting
• The $L(2,1)$-Labeling Problem on Graphs

Cited in

(2)

• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• 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

This page was built for publication: Distance constrained labelings of \(K_{4}\)-minor free graphs

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