A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
Fuente:
arXiv
Saved in:
| Main Authors: | Kovař, Petr, Zhang, Yifan |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
by: Kovář, Petr, et al.
Published: (2025)
by: Kovář, Petr, et al.
Published: (2025)
Minimum covering by triples, quadruples and quintuples with minimum excess
by: Kovář, Petr, et al.
Published: (2026)
by: Kovář, Petr, et al.
Published: (2026)
Decomposition of Cliques into $k$-Star-Forests
by: Nie, Jiaxi, et al.
Published: (2025)
by: Nie, Jiaxi, et al.
Published: (2025)
A coarse Erdős-Pósa theorem
by: Ahn, Jungho, et al.
Published: (2024)
by: Ahn, Jungho, et al.
Published: (2024)
Difference Methods for Double-Change Covering Designs
by: Chafee, Amanda Lynn, et al.
Published: (2022)
by: Chafee, Amanda Lynn, et al.
Published: (2022)
Cup Stacking in Graphs
by: Fay, Paul, et al.
Published: (2023)
by: Fay, Paul, et al.
Published: (2023)
Induced minors and subpolynomial treewidth
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Localized Erdős-Pósa Property for Subdivisions
by: Ai, Icey Siyi, et al.
Published: (2025)
by: Ai, Icey Siyi, et al.
Published: (2025)
A cube dismantling problem related to bootstrap percolation
by: Barát, János, et al.
Published: (2026)
by: Barát, János, et al.
Published: (2026)
Sets of equiangular lines in dimension $18$ constructed from $A_9 \oplus A_9 \oplus A_1$
by: Lin, Yen-chi Roger, et al.
Published: (2025)
by: Lin, Yen-chi Roger, et al.
Published: (2025)
Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
On essentially 4-edge-connected cubic bricks
by: Kothari, Nishad, et al.
Published: (2018)
by: Kothari, Nishad, et al.
Published: (2018)
Common neighbours in planar graphs
by: Maffucci, Riccardo W.
Published: (2025)
by: Maffucci, Riccardo W.
Published: (2025)
On the faces of unigraphic $3$-polytopes
by: Maffucci, Riccardo W.
Published: (2023)
by: Maffucci, Riccardo W.
Published: (2023)
Classification and Construction of Planar, 3-Connected Kronecker Products
by: Maffucci, Riccardo W.
Published: (2024)
by: Maffucci, Riccardo W.
Published: (2024)
Explicit geometric construction of Ramsey graphs
by: Kocbek, Matija
Published: (2025)
by: Kocbek, Matija
Published: (2025)
Vector encoding of phylogenetic trees by ordered leaf attachment
by: Richman, Harry, et al.
Published: (2025)
by: Richman, Harry, et al.
Published: (2025)
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
Local 2-separators
by: Carmesin, Johannes
Published: (2020)
by: Carmesin, Johannes
Published: (2020)
Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
by: Borgwardt, Steffen, et al.
Published: (2025)
by: Borgwardt, Steffen, et al.
Published: (2025)
Improved lower bounds for the maximum order of an induced acyclic subgraph
by: Asgarli, Shamil, et al.
Published: (2025)
by: Asgarli, Shamil, et al.
Published: (2025)
Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024)
by: Cambie, Stijn, et al.
Published: (2024)
The spread of fire on a random multigraph
by: Goldschmidt, Christina, et al.
Published: (2017)
by: Goldschmidt, Christina, et al.
Published: (2017)
New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)
by: Erdős, Péter L., et al.
Published: (2022)
Perfect $1$-factorisations of $K_{11,11}$
by: Allsop, Jack, et al.
Published: (2025)
by: Allsop, Jack, et al.
Published: (2025)
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
by: Heering, Philipp, et al.
Published: (2026)
by: Heering, Philipp, et al.
Published: (2026)
Incidence-free sets and edge domination in incidence graphs
by: Spiro, Sam, et al.
Published: (2022)
by: Spiro, Sam, et al.
Published: (2022)
5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
by: Inoue, Yuta, et al.
Published: (2025)
by: Inoue, Yuta, et al.
Published: (2025)
A dual view of Roman Domination: The 2-limited packing problem
by: Bachtler, Oliver, et al.
Published: (2026)
by: Bachtler, Oliver, et al.
Published: (2026)
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Roman $\{2\}$-domination on Graphs with "few" 4-paths
by: Fernández, Lara, et al.
Published: (2025)
by: Fernández, Lara, et al.
Published: (2025)
An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs
by: Zhang, Yuli, et al.
Published: (2025)
by: Zhang, Yuli, et al.
Published: (2025)
On the number of triangles in $K_4$-free graphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
by: Onofri, Elia
Published: (2024)
by: Onofri, Elia
Published: (2024)
Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
by: Polavarapu, Achintya Raya
Published: (2026)
by: Polavarapu, Achintya Raya
Published: (2026)
The wild number of an edge-colored graph
by: Anders, Katie, et al.
Published: (2025)
by: Anders, Katie, et al.
Published: (2025)
The saturation number of $K^s_t$
by: Zhao, Xinghui, et al.
Published: (2026)
by: Zhao, Xinghui, et al.
Published: (2026)
Cancellation and regularity for planar, 3-connected Kronecker products
by: De March, Ruben, et al.
Published: (2024)
by: De March, Ruben, et al.
Published: (2024)
Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
by: Grippo, Luciano N., et al.
Published: (2025)
by: Grippo, Luciano N., et al.
Published: (2025)
Similar Items
-
Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
by: Kovář, Petr, et al.
Published: (2025) -
Minimum covering by triples, quadruples and quintuples with minimum excess
by: Kovář, Petr, et al.
Published: (2026) -
Decomposition of Cliques into $k$-Star-Forests
by: Nie, Jiaxi, et al.
Published: (2025) -
A coarse Erdős-Pósa theorem
by: Ahn, Jungho, et al.
Published: (2024) -
Difference Methods for Double-Change Covering Designs
by: Chafee, Amanda Lynn, et al.
Published: (2022)