Determining the circular flow number of a cubic graph
From MaRDI portal
Publication:2656904
DOI10.37236/9607zbMATH Open1459.05109OpenAlexW3136748713MaRDI QIDQ2656904FDOQ2656904
Authors: R. Lukot'ka 
Publication date: 17 March 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9607
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21) Enumeration in graph theory (05C30)
Cites Work
- On (k,d)-colorings and fractional nowhere-zero flows
- On the degrees of the vertices of a directed graph
- Beyond the flow decomposition barrier
- The NP-Completeness of Edge-Coloring
- The number of fixed points of the majority rule
- Title not available (Why is that?)
- Nowhere-zero 6-flows
- Balanced Valuations and Flows in Multigraphs
- Computational results and new bounds for the circular flow number of snarks
- Pathwidth of cubic graphs and exact algorithms
- Real flow number and the cycle rank of a graph
- Counterexamples to Jaeger's circular flow conjecture
Cited In (7)
- Circular flow number of Goldberg snarks
- Construction of graphs with given circular flow numbers
- Flow number and circular flow number of signed cubic graphs
- A lower bound for the complex flow number of a graph: a geometric approach
- Bounded-excess flows in cubic graphs
- Computational results and new bounds for the circular flow number of snarks
- The circular flow number of a 6-edge connected graph is less than four
This page was built for publication: Determining the circular flow number of a cubic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656904)
