Recognition and characterization of unit interval graphs with integer endpoints

DOI10.1016/j.dam.2017.04.013zbMath1387.05166OpenAlexW2620963854MaRDI QIDQ1752493

F. Fernández Slezak, Guillermo Durán, Fabiano de S. Oliveira, Luciano N. Grippo, Jayme Luiz Szwarcfiter

Publication date: 24 May 2018

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

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

zbMATH Keywords

forbidden induced subgraphsproper interval graphsunit interval graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• On unit interval graphs with integer endpoints
• Simple linear time recognition of unit interval graphs
• Minimal representation of a semiorder
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
• Representation of a finite graph by a set of intervals on the real line
• Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

This page was built for publication: Recognition and characterization of unit interval graphs with integer endpoints