Prefer a chat interface with context about you and your work?
Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
Abstract A graph is concave‐round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave‐round graphs, solving a problem posed by Bang‐Jensen, Huang, …