Image de couverture de livre

Facial diagrams and cycle double cover

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ghanbari, Babak, Šámal, Robert
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximate cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

Counting the Number of Domatic Partition of a Graph
par: Alikhani, Saeid, et autres
Publié: (2024)

On minimum Venn diagrams
par: Brenner, Sofia, et autres
Publié: (2025)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
par: Dvořák, Pavel, et autres
Publié: (2023)

Counting Circuit Double Covers
par: Hušek, Radek, et autres
Publié: (2023)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
par: Brenner, Sofia, et autres
Publié: (2025)

Basis Number and Pathwidth
par: Miraftab, Babak, et autres
Publié: (2026)

Separation Number and Treewidth, Revisited
par: Houdrouge, Hussein, et autres
Publié: (2025)

Non-dissective coverings by planks
par: Kupavskii, Andrey, et autres
Publié: (2025)

$θ$-free matching covered graphs
par: Joshi, Rohinee, et autres
Publié: (2024)

Beyond recognizing well-covered graphs
par: Feghali, Carl, et autres
Publié: (2024)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Computational complexity of covering regular trees
par: Bok, Jan, et autres
Publié: (2025)

Intersecting families with covering number $3$
par: Kupavskii, Andrey
Publié: (2024)

Extremal minimal bipartite matching covered graphs
par: Mallik, Amit Kumar, et autres
Publié: (2024)

Planar cycle-extendable graphs
par: Dalwadi, Aditya Y, et autres
Publié: (2024)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

Efficient counting of permutation patterns via double posets
par: Diehl, Joscha, et autres
Publié: (2024)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
par: Nisse, Nicolas, et autres
Publié: (2023)

Dividing sums of cycles in the semiring of functional digraphs
par: Bridoux, Florian, et autres
Publié: (2025)

Erdős--Pósa property of cycles that are far apart
par: Dujmović, Vida, et autres
Publié: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
par: Hatzel, Meike, et autres
Publié: (2025)

Unavoidable butterfly minors in digraphs of large cycle rank
par: Hatzel, Meike, et autres
Publié: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
par: Goedgebeur, Jan, et autres
Publié: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
par: Soltani, Hossein, et autres
Publié: (2018)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
par: Botler, Fábio, et autres
Publié: (2024)

New bounds for the optimal density of covering single-insertion codes via the Turán density
par: Pikhurko, Oleg, et autres
Publié: (2024)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
par: Dai, Mengyao, et autres
Publié: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
par: Joret, Gwenaël, et autres
Publié: (2026)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
par: Ai, Jiangdong, et autres
Publié: (2025)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
par: Sawada, Joe, et autres
Publié: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
par: Jedličková, Nikola, et autres
Publié: (2023)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
par: Sawada, J., et autres
Publié: (2023)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
par: Kurapov, Sergey, et autres
Publié: (2024)

On Separating Path and Tree Systems in Graphs
par: Biniaz, Ahmad, et autres
Publié: (2023)

Random 2-cell embeddings of multistars
par: Loth, Jesse Campion, et autres
Publié: (2021)