Counting circuit double covers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10513662" target="_blank" >RIV/00216208:11320/25:10513662 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/25:00379064
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=u2rR13N8Ej" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=u2rR13N8Ej</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.23187" target="_blank" >10.1002/jgt.23187</a>
Alternative languages
Result language
angličtina
Original language name
Counting circuit double covers
Original language description
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to (Formula presented.) for some (Formula presented.)) instead of cycles (graphs with all degrees even). We give an almost-exponential lower bound for graphs with a surface embedding of representativity at least 4. We also prove an exponential lower bound for planar graphs. We conjecture that any bridgeless cubic graph has at least (Formula presented.) circuit double covers and we show an infinite class of graphs for which this bound is tight.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-17398S" target="_blank" >GA22-17398S: Flows and cycles in graphs on surfaces</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
1097-0118
Volume of the periodical
108
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
374-395
UT code for WoS article
001324395000001
EID of the result in the Scopus database
2-s2.0-85205355982