CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Proper circular arc graphs as intersection graphs of paths on a grid
Authors
Esther Galby
Maria Pia Mazzoleni
Bernard Ries
Publication date
28 August 2018
Publisher
View
on
arXiv
Abstract
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn)
Similar works
Full text
Available Versions
RERO DOC Digital Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:doc.rero.ch:20190805112647...
Last time updated on 15/08/2019