Abstract
Motivated by previous results on distance constrained labelings and coloring of squares of K 4 -minor free graphs, we show that for every p ≥ q ≥ 1 , there exists Δ 0 such that every K 4 -minor free graph G with maximum degree Δ ≥ Δ 0 has an L ( p , q ) -labeling of span at most q ⌊ 3 Δ ( G ) / 2 ⌋ . The obtained bound is the best possible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
