On unit interval graphs with integer endpoints

DOI10.1016/j.endm.2015.07.074zbMath1347.05125OpenAlexW2215867553MaRDI QIDQ324887

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

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.074

zbMATH Keywords

forbidden subgraphsproper interval graphsunit interval graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory ⋮ Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms ⋮ Recognition and characterization of unit interval graphs with integer endpoints ⋮ Extending partial representations of proper and unit interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Simple linear time recognition of unit interval graphs
• Minimal representation of a semiorder
• Short Models for Unit Interval Graphs
• 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: On unit interval graphs with integer endpoints