Cover Image

Triangle-Covered Graphs: Algorithms, Complexity, and Structure

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Madani, Amirali, Maheshwari, Anil, Miraftab, Babak, Żyliński, Paweł
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
by: Madani, Amirali, et al.
Published: (2025)

Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
by: Dumitrescu, Adrian
Published: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
by: Ghanbari, Babak, et al.
Published: (2026)

Complexity and Algorithm for the Matching vertex-cutset Problem
by: Li, Hengzhe, et al.
Published: (2025)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
by: Mu, Ta-Yu, et al.
Published: (2024)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
by: Abboud, Amir, et al.
Published: (2026)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
by: Gavva, Surya Teja, et al.
Published: (2025)

Sparse graphs with local covering conditions on edges
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
by: Aubian, Guillaume, et al.
Published: (2025)

Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)

Optimal Bounds for Distinct Quartics
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)

Lower Bounds on Tree Covers
by: Chen, Yu, et al.
Published: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
by: Babatunde, Abiola, et al.
Published: (2026)

Cover time of random subgraphs of the hypercube
by: Cooper, Colin, et al.
Published: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

A Note on Generic Tangle Algorithms
by: Elbracht, Christian, et al.
Published: (2020)

Space Complexity of Vertex Connectivity Oracles
by: Pettie, Seth, et al.
Published: (2022)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
by: Karamchedu, Mithra, et al.
Published: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
by: Ghanbari, Babak, et al.
Published: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
by: Jones, Mark, et al.
Published: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
by: Haviv, Ishay
Published: (2022)

Algorithmic study on liar's vertex-edge domination problem
by: Bhattacharya, Debojyoti, et al.
Published: (2023)

A Lower Bound for the Max Entropy Algorithm for TSP
by: Jin, Billy, et al.
Published: (2023)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
by: Bai, Yuhang, et al.
Published: (2026)

A Faster Deterministic Approximation Algorithm for TTP-2
by: Kanaya, Yuga, et al.
Published: (2023)

Random Generation of Git Graphs
by: Courtiel, Julien, et al.
Published: (2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
by: Norose, Ryoma, et al.
Published: (2024)

Sparsifying Cayley Graphs on Every Group
by: Hsieh, Jun-Ting, et al.
Published: (2025)

Distance Reconstruction of Sparse Random Graphs
by: Bastide, Paul
Published: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)

Paths and Intersections: Exact Emulators for Planar Graphs
by: Li, George Z., et al.
Published: (2025)

Graph parameters that are coarsely equivalent to tree-length
by: Dragan, Feodor F.
Published: (2025)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
by: Gribanov, Dmitry, et al.
Published: (2022)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
by: Dhawan, Abhishek
Published: (2024)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
by: Chalermsook, Parinya, et al.
Published: (2025)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)

A Maximum Linear Arrangement Problem on Directed Graphs
by: DeVos, Matt, et al.
Published: (2018)