On Z-flow-continuous maps and oriented colorings of cubic graphs
From MaRDI portal
Publication:4990130
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A remark on the Petersen coloring conjecture of Jaeger
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- A theorem on three-coloring the edges of a trivalent graph
- Blocking and anti-blocking pairs of polyhedra
- Computational results and new bounds for the circular flow number of snarks
- Construction of class two graphs with maximum vertex degree three
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On (k,d)-colorings and fractional nowhere-zero flows
- On edge-maps whose inverse preserves flows or tensions
- On the strong circular 5‐flow conjecture
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
Cited in
(4)
This page was built for publication: On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990130)