L(p,q)-labelling of K₄-minor free graphs

DOI10.1016/J.IPL.2006.02.005zbMATH Open1178.05085OpenAlexW2070712064MaRDI QIDQ844189FDOQ844189

Authors: Wang Weifan, Wang Yiqiao 

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.005

zbMATH Keywords

distancechannel assignment\(K_4\)-minor free graph\(L(p)\)-labelling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph minors (05C83)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A bound on the chromatic number of the square of a planar graph
• 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
• Topology of series-parallel networks
• A Theorem about the Channel Assignment Problem
• Coloring the square of a \(K_{4}\)-minor free graph
• Title not available (Why is that?)
• Note on coloring the square of an outerplanar graph

Cited In (2)

• 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 constrained labelings of \(K_{4}\)-minor free graphs

This page was built for publication: \(L(p,q)\)-labelling 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 Q844189)