scholarly journals A certifying and dynamic algorithm for the recognition of proper circular-arc graphs

2021 ◽  
Author(s):  
Francisco J. Soulignac
Keyword(s):  
Dynamic Algorithm ◽  
Circular Arc ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs

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

scholarly journals The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal

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
Keyword(s):  
Maximum Degree ◽  
Chromatic Index ◽  
Circular Arc ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

scholarly journals On chordal proper circular arc graphs

1994 ◽  
Vol 128 (1-3) ◽  
pp. 395-398 ◽  
Author(s):  
Jørgen Bang-Jensen ◽  
Pavol Hell
Keyword(s):  
Circular Arc ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

scholarly journals Proper circular arc graphs as intersection graphs of pathson a grid

2019 ◽  
Vol 262 ◽  
pp. 195-202 ◽  
Author(s):  
Esther Galby ◽  
María Pía Mazzoleni ◽  
Bernard Ries
Keyword(s):  
Intersection Graphs ◽  
Circular Arc ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

scholarly journals Isomorphism of graph classes related to the circular-ones property

2013 ◽  
Vol Vol. 15 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Andrew R. Curtis ◽  
Min Chih Lin ◽  
Ross M. Mcconnell ◽  
Yahav Nussbaum ◽  
Francisco Juan Soulignac ◽  
...  
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Circular Arc ◽  
Graph Classes ◽  
Discrete Algorithms ◽  
International Audience ◽  
Related Graph ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs

Discrete Algorithms International audience We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, Γ circular-arc graphs, proper circular-arc graphs and convex-round graphs.

Sign in / Sign up

Export Citation Format

Share Document