scholarly journals Structural results on circular-arc graphs and circle graphs: A survey and the main open problems

2014 ◽  
Vol 164 ◽  
pp. 427-443 ◽  
Author(s):  
Guillermo Durán ◽  
Luciano N. Grippo ◽  
Martín D. Safe
2005 ◽  
Vol Vol. 7 ◽  
Author(s):  
Sunil Chandran ◽  
Vadim V. Lozin ◽  
C.R. Subramanian

International audience The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show that co-circular-arc graphs and co-circle graphs have even chordality at most 4. We also identify few other classes of graphs having bounded (by a constant) chordality values.


2018 ◽  
Vol 35 (1) ◽  
pp. 739-748 ◽  
Author(s):  
Sk. Amanathulla ◽  
Madhumangal Pal

1981 ◽  
Vol 2 (2) ◽  
pp. 88-93 ◽  
Author(s):  
James B. Orlin ◽  
Maurizio A. Bonuccelli ◽  
Daniel P. Bovet

2019 ◽  
Vol 346 ◽  
pp. 125-133
Author(s):  
João Pedro W. Bernardi ◽  
Murilo V.G. da Silva ◽  
André Luiz P. Guedes ◽  
Leandro M. Zatesko

Sign in / Sign up

Export Citation Format

Share Document