Short models for unit interval graphs
From MaRDI portal
Publication:2840545
DOI10.1016/J.ENDM.2009.11.041zbMATH Open1268.05138OpenAlexW2038728506MaRDI QIDQ2840545FDOQ2840545
Authors: Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.041
Recommendations
- On unit interval graphs with integer endpoints
- The Roberts characterization of proper and unit interval graphs
- Recognition and characterization of unit interval graphs with integer endpoints
- Simple linear time recognition of unit interval graphs
- A note on the unit interval number and proper interval number of graphs.
graph theoryproper interval graphsunit interval graphsalgorithms and data structuresefficient representation
Cites Work
- Efficient graph representations
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Title not available (Why is that?)
- Simple linear time recognition of unit interval graphs
- Unit Circular-Arc Graph Representations and Feasible Circulations
- Powers of cycles, powers of paths, and distance graphs
- A short proof that `proper = unit'
- The Roberts characterization of proper and unit interval graphs
Cited In (6)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
- On unit interval graphs with integer endpoints
- On the non-unit count of interval graphs
- The Roberts characterization of proper and unit interval graphs
- On sum coloring and sum multi-coloring for restricted families of graphs
- Normal Helly circular-arc graphs and its subclasses
This page was built for publication: Short models for unit interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840545)