Score: 0
New Vertex Ordering Characterizations of Circular-Arc Bigraphs
Published: March 13, 2025 |
arXiv ID: 2503.10852v2
By: Indrajit Paul, Ashok Kumar Das
Potential Business Impact:
Finds patterns in connected dots to understand them.
Business Areas:
A/B Testing
Data and Analytics
In this article, we present two new characterizations of circular-arc bigraphs based on their vertex ordering. Also, we provide a characterization of circular-arc bigraphs in terms of forbidden patterns with respect to a particular ordering of their vertices.
Similar Papers
94%
Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
Discrete Mathematics
Helps computers understand complex graph patterns.
22 Sep 2025
0
86%
Vertex-ordering and arc-partitioning problems
Combinatorics
Helps computers sort things faster and more efficiently.
5 Sep 2025
0
84%
Characterization of Split Comparability Graphs
Combinatorics
Helps understand how groups of things connect.
27 Apr 2025
0