Labeling bipartite permutation graphs with a condition at distance two

DOI10.1016/j.dam.2009.02.004zbMath1211.05137OpenAlexW1991411408MaRDI QIDQ1026125

Toru Araki

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.004

zbMATH Keywords

channel assignment\(L(p,q)\)-labelingbipartite permutation graphdistance two labelingbiclique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

\(L(2, 1)\)-labeling of circulant graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ Permutation bigraphs and interval containments ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ The \(L(2,1)\)-labeling of unigraphs

Cites Work

• Channel assignment for interference avoidance in honeycomb wireless networks
• Acyclic domination on bipartite permutation graphs
• \(\lambda\)-coloring matrogenic graphs
• Bipartite permutation graphs
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• On the \(k\)-path partition of graphs.
• Algorithmic graph theory and perfect graphs
• Linear structure of bipartite permutation graphs and the longest path problem
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• A survey on labeling graphs with a condition at distance two
• Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs
• Backbone colorings for graphs: Tree and path backbones
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Graph Classes: A Survey
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Theoretical Computer Science
• Graph-Theoretic Concepts in Computer Science
• Automata, Languages and Programming

This page was built for publication: Labeling bipartite permutation graphs with a condition at distance two