Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property

DOI10.1002/jgt.22486zbMath1495.05067arXiv1611.02216OpenAlexW2969821358WikidataQ127370107 ScholiaQ127370107MaRDI QIDQ5110656

Martín D. Safe

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02216

zbMATH Keywords

forbidden induced subgraphscircular-arc graphscircular-ones propertyforbidden submatricesconcave-round graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

2-nested matrices: towards understanding the structure of circle graphs ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers

This page was built for publication: Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property