Cubic Bridgeless Graphs and Braces

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10332281" target="_blank" >RIV/00216208:11320/16:10332281 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00373-016-1722-y" target="_blank" >http://dx.doi.org/10.1007/s00373-016-1722-y</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-016-1722-y" target="_blank" >10.1007/s00373-016-1722-y</a>

Result language
angličtina
Original language name
Cubic Bridgeless Graphs and Braces
Original language description
There are many long-standing open problems on cubic bridgeless graphs, for instance, Jaeger's directed cycle double cover conjecture. On the other hand, many structural properties of braces have been recently discovered. In this work, we bijectively map the cubic bridgeless graphs to braces which we call the hexagon graphs, and explore the structure of hexagon graphs. We show that hexagon graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig's augmentations. In addition, we present a reformulation of Jaeger's directed cycle double cover conjecture in the class of hexagon graphs.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA13-21988S" target="_blank" >GA13-21988S: Enumeration in informatics and optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)