Pages that link to "Item:Q2656904"
From MaRDI portal
The following pages link to Determining the circular flow number of a cubic graph (Q2656904):
Displaying 6 items.
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- The circular flow number of a 6-edge connected graph is less than four (Q1857409) (← links)
- Flow number and circular flow number of signed cubic graphs (Q2142658) (← links)
- Construction of graphs with given circular flow numbers (Q4422617) (← links)
- Bounded‐excess flows in cubic graphs (Q5066914) (← links)
- Circular flow number of Goldberg snarks (Q6136676) (← links)