Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.18593 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A quotient-lifting approach to the Hamiltonicity of the cylindrical 5-puzzle graph
by: Sadahiro, Taizo
Published: (2025)
by: Sadahiro, Taizo
Published: (2025)
Maximal Cells in Shifted Staircase Tableaux and a Quarter-Circle Law
by: Kubota, Chihiro, et al.
Published: (2025)
by: Kubota, Chihiro, et al.
Published: (2025)
Non-isomorphic Cayley Graphs with Same Random Walk Distributions
by: Ishikawa, Masao, et al.
Published: (2024)
by: Ishikawa, Masao, et al.
Published: (2024)
An Elliptic Curve Governing Hopf Linking in an $A_4$-Symmetric Tensegrity
by: Sadahiro, Taizo
Published: (2026)
by: Sadahiro, Taizo
Published: (2026)
Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)
by: Dusollier, Valentin, et al.
Published: (2025)
On the $4$-clique cover number of graphs
by: Chen, Yihan, et al.
Published: (2025)
by: Chen, Yihan, et al.
Published: (2025)
A characterization of graphs with no $K_{3,4}$ minor
by: Lo, On-Hei Solomon
Published: (2026)
by: Lo, On-Hei Solomon
Published: (2026)
Uniquely realisable graphs in polyhedral normed spaces
by: Dewar, Sean
Published: (2025)
by: Dewar, Sean
Published: (2025)
Hamiltonicity of covering graphs of trees
by: Bradshaw, Peter, et al.
Published: (2022)
by: Bradshaw, Peter, et al.
Published: (2022)
Coarsening polyhedral complexes
by: Reading, Nathan
Published: (2010)
by: Reading, Nathan
Published: (2010)
On the clique covering numbers of Johnson graphs
by: Jørgensen, Søren Fuglede
Published: (2025)
by: Jørgensen, Søren Fuglede
Published: (2025)
Counterexamples to statements on isometric graph coverings
by: Bastide, Paul, et al.
Published: (2025)
by: Bastide, Paul, et al.
Published: (2025)
Tight cuts in matching covered graphs
by: Lu, Fuliang, et al.
Published: (2026)
by: Lu, Fuliang, et al.
Published: (2026)
Clique covers and decompositions of cliques of graphs
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
Completely regular codes in graphs covered by a Hamming graph
by: Goryainov, Sergey, et al.
Published: (2024)
by: Goryainov, Sergey, et al.
Published: (2024)
Monge-Ampère measures on balanced polyhedral spaces
by: Botero, Ana María, et al.
Published: (2026)
by: Botero, Ana María, et al.
Published: (2026)
On values of $\mathfrak{sl}_3$ weight system on chord diagrams whose intersection graph is complete bipartite
by: Yang, Zhuoke
Published: (2021)
by: Yang, Zhuoke
Published: (2021)
Schreier graphs: transitivity and coverings
by: Leemann, Paul-Henry
Published: (2015)
by: Leemann, Paul-Henry
Published: (2015)
When do graph covers preserve the clique dynamics of infinite graphs?
by: Limbach, Anna M., et al.
Published: (2025)
by: Limbach, Anna M., et al.
Published: (2025)
Sparse graphs with local covering conditions on edges
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Removable edges in cubic matching covered graphs
by: Fuliang, Lu, et al.
Published: (2022)
by: Fuliang, Lu, et al.
Published: (2022)
Higher-rank trees arising from polyhedral graphs
by: Pask, David
Published: (2024)
by: Pask, David
Published: (2024)
So's conjecture for integral circulant graphs of $4$ types
by: Li, Hao, et al.
Published: (2024)
by: Li, Hao, et al.
Published: (2024)
Implementing real polyhedral homotopy
by: Lee, Kisun, et al.
Published: (2022)
by: Lee, Kisun, et al.
Published: (2022)
On the local metric dimension of $K_4$-free graphs
by: Ghalavand, Ali, et al.
Published: (2025)
by: Ghalavand, Ali, et al.
Published: (2025)
Balanced bipartite distance of $K_4$-free graphs
by: Balogh, József, et al.
Published: (2026)
by: Balogh, József, et al.
Published: (2026)
K_4-free graphs have sparse halves
by: Reiher, Christian
Published: (2021)
by: Reiher, Christian
Published: (2021)
On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)
by: Joshi, Rohinee, et al.
Published: (2024)
Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)
by: Feghali, Carl, et al.
Published: (2024)
Wheel-like bricks and minimal matching covered graphs
by: He, Xiaoling, et al.
Published: (2024)
by: He, Xiaoling, et al.
Published: (2024)
The double Hall property and cycle covers in bipartite graphs
by: Barát, János, et al.
Published: (2023)
by: Barát, János, et al.
Published: (2023)
Classification of polyhedral graphs by numbers of common neighbours
by: Maffucci, Riccardo W.
Published: (2025)
by: Maffucci, Riccardo W.
Published: (2025)
Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
by: Tian, Tao, et al.
Published: (2026)
by: Tian, Tao, et al.
Published: (2026)
Structural similarity between polyhedral embeddings and their duals and its application to self-duality of pathwidth
by: Yokoi, Hikaru
Published: (2026)
by: Yokoi, Hikaru
Published: (2026)
Adjacent vertices of small degree in minimal matching covered graphs
by: He, Xiaoling, et al.
Published: (2026)
by: He, Xiaoling, et al.
Published: (2026)
Edge-transitive token graphs as covers
by: Gómez-Galicia, Sergio G., et al.
Published: (2025)
by: Gómez-Galicia, Sergio G., et al.
Published: (2025)
Polynomial graph invariants induced from the ${\mathfrak gl}$-weight system
by: Kodaneva, N., et al.
Published: (2023)
by: Kodaneva, N., et al.
Published: (2023)
The independence and clique cover numbers of the squarefree graph
by: Alexeev, Boris, et al.
Published: (2025)
by: Alexeev, Boris, et al.
Published: (2025)
Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)
by: Mallik, Amit Kumar, et al.
Published: (2024)