\(L(2,1)\)-labeling of perfect elimination bipartite graphs
From MaRDI portal
Publication:643028
DOI10.1016/j.dam.2010.07.008zbMath1228.05254OpenAlexW1741136134MaRDI QIDQ643028
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.008
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Exact square coloring of graphs resulting from some graph operations and products, \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Labeling bipartite permutation graphs with a condition at distance two
- Characterizations of strongly chordal graphs
- Bipartite permutation graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Biconvex graphs: Ordering and algorithms
- \(L(h,1)\)-labeling subclasses of planar graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- On the \(L(p,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- Characterizations of totally balanced matrices
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Labelling Graphs with a Condition at Distance 2
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Perfect Elimination and Chordal Bipartite Graphs
- Graph Classes: A Survey
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- The $L(2,1)$-Labeling Problem on Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Algorithms and Computation
- Fixed-parameter complexity of \(\lambda\)-labelings
