Characterization of Circular-arc Graphs: II. McConnell Flipping
Fuente:
arXiv
Saved in:
| Main Authors: | Cao, Yixin, Krawczyk, Tomasz |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
by: Krawczyk, Tomasz
Published: (2024)
by: Krawczyk, Tomasz
Published: (2024)
Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024)
by: Derbisz, Jan, et al.
Published: (2024)
Switching Classes: Characterization and Computation
by: Antony, Dhanyamol, et al.
Published: (2024)
by: Antony, Dhanyamol, et al.
Published: (2024)
On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024)
by: Krawczyk, Tomasz
Published: (2024)
Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
by: Chalermsook, Parinya, et al.
Published: (2025)
by: Chalermsook, Parinya, et al.
Published: (2025)
On Circular Threshold Words and Other Stronger Versions of Dejean's conjecture
by: Tunev, Igor N.
Published: (2025)
by: Tunev, Igor N.
Published: (2025)
A Combinatorial Characterization of Constant Mixing Time
by: Lau, Lap Chi, et al.
Published: (2025)
by: Lau, Lap Chi, et al.
Published: (2025)
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
by: Charbit, Pierre, et al.
Published: (2025)
by: Charbit, Pierre, et al.
Published: (2025)
Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
by: Karamchedu, Mithra, et al.
Published: (2025)
by: Karamchedu, Mithra, et al.
Published: (2025)
Random Generation of Git Graphs
by: Courtiel, Julien, et al.
Published: (2024)
by: Courtiel, Julien, et al.
Published: (2024)
Distance Reconstruction of Sparse Random Graphs
by: Bastide, Paul
Published: (2024)
by: Bastide, Paul
Published: (2024)
Sparsifying Cayley Graphs on Every Group
by: Hsieh, Jun-Ting, et al.
Published: (2025)
by: Hsieh, Jun-Ting, et al.
Published: (2025)
Triangle-Covered Graphs: Algorithms, Complexity, and Structure
by: Madani, Amirali, et al.
Published: (2025)
by: Madani, Amirali, et al.
Published: (2025)
Paths and Intersections: Exact Emulators for Planar Graphs
by: Li, George Z., et al.
Published: (2025)
by: Li, George Z., et al.
Published: (2025)
Graph parameters that are coarsely equivalent to tree-length
by: Dragan, Feodor F.
Published: (2025)
by: Dragan, Feodor F.
Published: (2025)
Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
by: Mu, Ta-Yu, et al.
Published: (2024)
by: Mu, Ta-Yu, et al.
Published: (2024)
Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)
by: Biedl, Therese, et al.
Published: (2024)
On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
by: Chalermsook, Parinya, et al.
Published: (2025)
by: Chalermsook, Parinya, et al.
Published: (2025)
A Maximum Linear Arrangement Problem on Directed Graphs
by: DeVos, Matt, et al.
Published: (2018)
by: DeVos, Matt, et al.
Published: (2018)
Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
by: Hathcock, Daniel, et al.
Published: (2025)
by: Hathcock, Daniel, et al.
Published: (2025)
Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
by: Gavva, Surya Teja, et al.
Published: (2025)
by: Gavva, Surya Teja, et al.
Published: (2025)
A Unified View of Graph Regularity via Matrix Decompositions
by: Bodwin, Greg, et al.
Published: (2019)
by: Bodwin, Greg, et al.
Published: (2019)
Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
by: Dhawan, Abhishek
Published: (2024)
by: Dhawan, Abhishek
Published: (2024)
Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
by: Aubian, Guillaume, et al.
Published: (2025)
by: Aubian, Guillaume, et al.
Published: (2025)
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
by: Glover, Charles N.
Published: (2024)
by: Glover, Charles N.
Published: (2024)
Vertex-ordering and arc-partitioning problems
by: Borsik, Nóra A., et al.
Published: (2025)
by: Borsik, Nóra A., et al.
Published: (2025)
Cluster Vertex Deletion on Chordal Graphs
by: Cao, Yixin, et al.
Published: (2026)
by: Cao, Yixin, et al.
Published: (2026)
Characterizing and Testing Principal Minor Equivalence of Matrices
by: Chatterjee, Abhranil, et al.
Published: (2024)
by: Chatterjee, Abhranil, et al.
Published: (2024)
EPTAS for Hard Graph Cut Problems for Dense Graphs
by: Deguchi, Kaisei, et al.
Published: (2026)
by: Deguchi, Kaisei, et al.
Published: (2026)
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
by: Scheinerman, Danny
Published: (2024)
by: Scheinerman, Danny
Published: (2024)
Counting Permutation Patterns with Multidimensional Trees
by: Beniamini, Gal, et al.
Published: (2024)
by: Beniamini, Gal, et al.
Published: (2024)
Lightweight Near-Additive Spanners
by: Gitlitz, Yuval, et al.
Published: (2024)
by: Gitlitz, Yuval, et al.
Published: (2024)
Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)
by: Michel, Lukas, et al.
Published: (2024)
Matroid Intersection under Minimum Rank Oracle
by: Bárász, Mihály, et al.
Published: (2024)
by: Bárász, Mihály, et al.
Published: (2024)
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
by: Nozaki, Yuta, et al.
Published: (2024)
by: Nozaki, Yuta, et al.
Published: (2024)
Minor Containment and Disjoint Paths in almost-linear time
by: Korhonen, Tuukka, et al.
Published: (2024)
by: Korhonen, Tuukka, et al.
Published: (2024)
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)
by: Murakami, Hitoshi, et al.
Published: (2024)
Similar Items
-
Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
by: Krawczyk, Tomasz
Published: (2024) -
Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024) -
Switching Classes: Characterization and Computation
by: Antony, Dhanyamol, et al.
Published: (2024) -
On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024) -
Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)