Score: 0
Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
Published: September 22, 2025 |
arXiv ID: 2509.18021v1
By: Indrajit Paul, Ashok Kumar Das
Potential Business Impact:
Helps computers understand complex graph patterns.
Business Areas:
Data Visualization
Data and Analytics, Design, Information Technology, Software
We introduce the class of circular-arc H-graphs, which generalizes circular-arc graphs, particularly circular-arc bigraphs. We investigate two types of ordering-based characterizations of circular-arc r-graphs. Finally, we provide forbidden patterns for circular-arc r-graphs in terms of specific vertex orderings.
Similar Papers
94%
New Vertex Ordering Characterizations of Circular-Arc Bigraphs
Combinatorics
Finds patterns in connected dots to understand them.
13 Mar 2025
0
86%
Interval H-graphs : Recognition and forbidden obstructions
Discrete Mathematics
Maps connections between groups using number lines.
2 Mar 2025
1
84%
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
Combinatorics
Makes information flow predictable in changing networks.
8 Oct 2025
0
Page Count
22 pages
Category
Computer Science:
Discrete Mathematics