Graph Coloring Below Guarantees via Co-Triangle Packing
Fuente:
arXiv
Saved in:
| Main Authors: | Akmal, Shyan, Koana, Tomohiro |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)
by: Akmal, Shyan, et al.
Published: (2026)
An Enumerative Perspective on Connectivity
by: Akmal, Shyan
Published: (2023)
by: Akmal, Shyan
Published: (2023)
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025)
by: Akmal, Shyan, et al.
Published: (2025)
Detecting Disjoint Shortest Paths in Linear Time and More
by: Akmal, Shyan, et al.
Published: (2024)
by: Akmal, Shyan, et al.
Published: (2024)
Faster algorithms on linear delta-matroids
by: Koana, Tomohiro, et al.
Published: (2024)
by: Koana, Tomohiro, et al.
Published: (2024)
Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Online Graph Coloring for $k$-Colorable Graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
Triangle-free 2-matchings
by: Paluch, Katarzyna
Published: (2023)
by: Paluch, Katarzyna
Published: (2023)
On the Structural Parameterizations of 2-Club with Triangle Constraints
by: Jacob, Ashwin, et al.
Published: (2025)
by: Jacob, Ashwin, et al.
Published: (2025)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Parameterized Complexity of Path Set Packing
by: Aravind, N. R., et al.
Published: (2022)
by: Aravind, N. R., et al.
Published: (2022)
Reconfiguration of Multisets with Applications to Bin Packing
by: Kam, Jeffrey, et al.
Published: (2024)
by: Kam, Jeffrey, et al.
Published: (2024)
Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)
by: McKay, Michael, et al.
Published: (2022)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)
by: Mömke, Tobias, et al.
Published: (2024)
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
by: Brubach, Brian, et al.
Published: (2021)
by: Brubach, Brian, et al.
Published: (2021)
On the compressiveness of the Burrows-Wheeler transform
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
by: Rosenke, Christian, et al.
Published: (2026)
by: Rosenke, Christian, et al.
Published: (2026)
A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
by: Iwata, Satoru, et al.
Published: (2024)
by: Iwata, Satoru, et al.
Published: (2024)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
by: Antony, Dhanyamol, et al.
Published: (2023)
by: Antony, Dhanyamol, et al.
Published: (2023)
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
by: Dudeja, Aditi, et al.
Published: (2024)
by: Dudeja, Aditi, et al.
Published: (2024)
Solving the List Coloring Problem through a Branch-and-Price algorithm
by: Lucci, Mauro, et al.
Published: (2023)
by: Lucci, Mauro, et al.
Published: (2023)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Graph Visualization for Blockchain Data
by: Dietl, Marcell, et al.
Published: (2024)
by: Dietl, Marcell, et al.
Published: (2024)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)
by: Madani, Amirali, et al.
Published: (2023)
Online Graph Balancing and the Power of Two Choices
by: Bansal, Nikhil, et al.
Published: (2026)
by: Bansal, Nikhil, et al.
Published: (2026)
Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)
by: Bals, Ben, et al.
Published: (2026)
Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
Tight Paths and Tight Pairs in Weighted Directed Graphs
by: Balcázar, José Luis
Published: (2025)
by: Balcázar, José Luis
Published: (2025)
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
by: Dahan, Anatole, et al.
Published: (2026)
by: Dahan, Anatole, et al.
Published: (2026)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2024)
by: Paul-Pena, Daniel, et al.
Published: (2024)
Algorithmic Results for Weak Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
by: Gahlawat, Harmender, et al.
Published: (2025)
by: Gahlawat, Harmender, et al.
Published: (2025)
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
by: Mathur, Yashaswini, et al.
Published: (2025)
by: Mathur, Yashaswini, et al.
Published: (2025)
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
by: Abbasi, Ali, et al.
Published: (2026)
by: Abbasi, Ali, et al.
Published: (2026)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
Similar Items
-
Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026) -
An Enumerative Perspective on Connectivity
by: Akmal, Shyan
Published: (2023) -
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
by: Abboud, Amir, et al.
Published: (2025) -
Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025) -
Detecting Disjoint Shortest Paths in Linear Time and More
by: Akmal, Shyan, et al.
Published: (2024)