Cover Image

Characterizing and Transforming DAGs within the I-LCA Framework

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hellmuth, Marc, Lindeberg, Anna
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

Orthology and Near-Cographs in the Context of Phylogenetic Networks
by: Lindeberg, Anna, et al.
Published: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
by: Hatzel, Meike, et al.
Published: (2024)

Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
by: Ebert, Patricia A., et al.
Published: (2026)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
by: Hellmuth, Marc, et al.
Published: (2023)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)

On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)

Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)

Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024)

Characterization of Word-Representable Graphs using Modular Decomposition
by: Dwary, Tithi, et al.
Published: (2024)

Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
by: Petersen, Johannes B. S., et al.
Published: (2025)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)

On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

Token Sliding Reconfiguration on DAGs
by: Dirks, Jona, et al.
Published: (2025)

Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, et al.
Published: (2026)