Counting circuit double covers
From MaRDI portal
Publication:6657602
DOI10.1002/JGT.23187MaRDI QIDQ6657602
Publication date: 6 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Exponentially many perfect matchings in cubic graphs
- Congruent graphs and the connectivity of graphs
- Many 3-colorings of triangle-free planar graphs
- Exponentially many 5-list-colorings of planar graphs
- Graph minors. VII: Disjoint paths on a surface
- A unified approach to distance-two colouring of graphs on surfaces
- A bound on the chromatic number of the square of a planar graph
- On Polyhedral Embeddings of Cubic Graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decompositions and reductions of snarks
- Graphs on Surfaces
- Polyhedral decompositions of cubic graphs
- The Arithmetic of Bell and Stirling Numbers
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
This page was built for publication: Counting circuit double covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657602)
