L(2,1)-labeling of perfect elimination bipartite graphs

DOI10.1016/J.DAM.2010.07.008zbMATH Open1228.05254OpenAlexW1741136134MaRDI QIDQ643028FDOQ643028

Authors: B. S. Panda, Preeti Goel 

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

Recommendations

• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Labeling bipartite permutation graphs with a condition at distance two
• The \(L(3,2,1)\)-labeling on bipartite graphs

zbMATH Keywords

graph algorithmsNP-completeperfect elimination bipartite graphs\(L(2, 1)\)-labeling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graph Classes: A Survey
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Algorithms and Computation
• Labelling Graphs with a Condition at Distance 2
• Characterizations of strongly chordal graphs
• Bipartite permutation graphs
• A survey on labeling graphs with a condition at distance two
• Characterizations of totally balanced matrices
• \(L(h,1)\)-labeling subclasses of planar graphs
• Perfect Elimination and Chordal Bipartite Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Bipartite permutation graphs with application to the minimum buffer size problem
• Fixed-parameter complexity of \(\lambda\)-labelings
• On the \(L(p,1)\)-labelling of graphs
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Title not available (Why is that?)
• Labeling bipartite permutation graphs with a condition at distance two
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• Biconvex graphs: Ordering and algorithms
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
• Title not available (Why is that?)
• Efficient parallel algorithms for doubly convex-bipartite graphs

Cited In (7)

• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• Labeling bipartite permutation graphs with a condition at distance two
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
• Structural Information and Communication Complexity
• Title not available (Why is that?)
• Exact square coloring of graphs resulting from some graph operations and products
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs

This page was built for publication: \(L(2,1)\)-labeling of perfect elimination bipartite graphs

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