On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs

DOI10.1002/net.20257zbMath1167.05043OpenAlexW4244431239MaRDI QIDQ5191125

Stephan Olariu, Rossella Petreschi, Saverio Caminiti, Tiziana Calamoneri

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20257

zbMATH Keywords

interval graphscircular-arc graphsco-comparability graphs\(L(h, k)\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (10)

\(L(2, 1)\)-labeling of circulant graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ L(2,1,1)-labeling of interval graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ The \(L(2,1)\)-labeling of unigraphs ⋮ Distance two surjective labelling of paths and interval graphs ⋮ Coloring squares of graphs via vertex orderings ⋮ L(3,2,1)-Labeling problems on trapezoid graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tolerance graphs
• Conflict-free star-access in parallel memory systems
• An optimal greedy heuristic to color interval graphs
• Distances in cocomparability graphs and their powers
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• Optimal greedy algorithms for indifference graphs
• Domination on Cocomparability Graphs
• Representation of a finite graph by a set of intervals on the real line
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The Complexity of Coloring Circular Arcs and Chords
• Algorithmic Aspects of Vertex Elimination on Graphs
• Theoretical Limitations on the Efficient Use of Parallel Memories
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• Asteroidal Triple-Free Graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Graph Sandwich Problems
• Mapping the genome
• Linear Orderings of Subfamilies of AT‐Free Graphs
• Permutation Graphs and Transitive Graphs

This page was built for publication: On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs