Abstract
In our first remark we observe a property of circular arcs which is similar to the Helly property and is helpful in describing all maximal cliques in circular arc graphs (as well as allowing us to genralize a result of Tucker). Our main result is a new simple characterization of circular arc graphs of clique covering number two. These graphs play a crucial role in recognition algorithms for circular arc graphs, and have been characterized by several authors. Specifically, we show that a graph with clique covering number two is a circular arc graph if and only if its edges can be coloured by two colours so that no induced four-cycle contains two opposite edges of the same colour. Our proof of the characterization depends on the ‘lexicographic method’ we have recently introduced. Both remarks could be useful in designing efficient algorithms for (maximum cliques in, respectively recognition of) circular arc graphs
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
