Determining the circular flow number of a cubic graph

DOI10.37236/9607MaRDI QIDQ2656904zbMATH OpenOpenAlexFDO

Authors R. Lukot'ka

Publication date 17 March 2021

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/9607

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

polynomial algorithmsbridgeless graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21) Enumeration in graph theory (05C30)

Recommendations

• Flow number and circular flow number of signed cubic graphs
• Computational results and new bounds for the circular flow number of snarks
• Nowhere-zero 5-flows on cubic graphs with oddness 4
• Circular flow numbers of regular multigraphs

Cites work

• scientific article; zbMATH DE number 3904637 (Why is no real title available?)
• Balanced Valuations and Flows in Multigraphs
• Beyond the flow decomposition barrier
• Computational results and new bounds for the circular flow number of snarks
• Counterexamples to Jaeger's circular flow conjecture
• Nowhere-zero 6-flows
• On (k,d)-colorings and fractional nowhere-zero flows
• On the degrees of the vertices of a directed graph
• Pathwidth of cubic graphs and exact algorithms
• Real flow number and the cycle rank of a graph
• The NP-Completeness of Edge-Coloring
• The number of fixed points of the majority rule

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
• Bounded-excess flows in cubic graphs
• A lower bound for the complex flow number of a graph: a geometric approach
• 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)