Strictly Interval Graphs: Characterization and Linear Time Recognition

2016 ◽  
Vol 52 ◽  
pp. 181-188
Author(s):  
L. Markenzon ◽  
C.F.E.M. Waga
Keyword(s):  
1995 ◽  
Vol 55 (2) ◽  
pp. 99-104 ◽  
Author(s):  
Derek G Corneil ◽  
Hiryoung Kim ◽  
Sridhar Natarajan ◽  
Stephan Olariu ◽  
Alan P Sprague

Author(s):  
Hajo Broersma ◽  
Jiří Fiala ◽  
Petr A. Golovach ◽  
Tomáš Kaiser ◽  
Daniël Paulusma ◽  
...  

2014 ◽  
Vol 22 (3) ◽  
pp. 37-44
Author(s):  
Marilena Crupi ◽  
Giancarlo Rinaldo

Abstract Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.


1989 ◽  
Vol 18 (1) ◽  
pp. 68-81 ◽  
Author(s):  
Norbert Korte ◽  
Rolf H. Möhring

2014 ◽  
Vol 79 (4) ◽  
pp. 282-299 ◽  
Author(s):  
Hajo Broersma ◽  
Jiří Fiala ◽  
Petr A. Golovach ◽  
Tomáš Kaiser ◽  
Daniël Paulusma ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document