arXiv (All)
open access
Computing and Bounding the Number of Eulerian Orientations for Certain Classes of $4$-Regular Graphs
An Eulerian orientation of a $4$-regular undirected graph (simple or multigraph) $G=(V,E)$ with $n=|V|$ vertices is an assignment of directions to its edges such that every vertex $v \in V$ has the same indegree and outdegree. In the present article, we improve the bounds on the number of Eulerian o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The maximum number of edges in minimal matching covered graphs#1105537
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1169673
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1145185
- Cover times of the cycle graph#153626
- Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\geq 4$#925335
Record · ID 974800
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive