On (k,d)-colorings and fractional nowhere-zero flows
From MaRDI portal
Publication:4242967
Recommendations
- Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
- Fractional colouring and Hadwiger's conjecture
- Nowhere-zero \(\vec{k}\)-flows on graphs
- scientific article; zbMATH DE number 1536522
- Fractional coloring and the odd Hadwiger's conjecture
- Towards a flow theory for the dichromatic number
- Fractional \(\mathcal Q\)-edge-coloring of graphs
- On the parity of colourings and flows
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
Cited in
(60)- Matroid invariants and counting graph homomorphisms
- Circular flow number of Goldberg snarks
- Spanning triangle-trees and flows of graphs
- Homomorphisms of Cayley graphs and cycle double covers
- Circular flows in planar graphs
- Resource-sharing systems and hypergraph colorings
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Bicircular matroids are 3-colorable
- Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
- Snarks with given real flow numbers
- Circular flow number of highly edge connected signed graphs
- Packing spanning trees in highly essentially connected graphs
- Determining the circular flow number of a cubic graph
- Circular chromatic numbers of Mycielski's graphs
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- Antisymmetric flows in matroids
- On the chromatic number of an oriented matroid
- The flow index of regular class I graphs
- Spectral radius and edge‐disjoint spanning trees
- The flow index and strongly connected orientations
- The Set of Circular Flow Numbers of Regular Graphs
- Real flow number and the cycle rank of a graph
- Flows and parity subgraphs of graphs with large odd-edge-connectivity
- Coloring-flow duality of embedded graphs
- Ban–Linial's Conjecture and treelike snarks
- Short cycle covers of graphs and nowhere-zero flows
- Some snarks are worse than others
- Measures of edge-uncolorability of cubic graphs
- Circular flow on signed graphs
- Cubic graphs that cannot be covered with four perfect matchings
- Nearly nowhere-zero \(r\)-flow graphs
- A connection between circular colorings and periodic schedules
- Integer flows and modulo orientations of signed graphs
- The circular chromatic number of induced subgraphs
- Computational results and new bounds for the circular flow number of snarks
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Contractible graphs for flow index less than three
- Star chromatic numbers of graphs
- A unified approach to construct snarks with circular flow number 5
- Resource-sharing system scheduling and circular chromatic number
- Circular colouring and orientation of graphs
- Flows, flow-pair covers and cycle double covers
- High-girth graphs avoiding a minor are nearly bipartite
- On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
- Edge Colorings and Circular Flow Numbers of Regular Graphs
- Asymptotic lower bounds on circular chromatic index of snarks
- Planar graphs with circular chromatic numbers between 3 and 4
- Circular flow numbers of regular multigraphs
- Circular zero-sum r-flows of regular graphs
- Perfect matching index versus circular flow number of a cubic graph
- Flows on signed graphs without long barbells
- Edge colorings and circular flows on regular graphs
- Extending precolorings to circular colorings
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs
- The circular chromatic number of hypergraphs
- Complementary graphs with flows less than three
- Treelike snarks
- Circular flows via extended Tutte orientations
- Chromatic number and orientations of graphs and signed graphs
- The circular altitude of a graph
This page was built for publication: On (k,d)-colorings and fractional nowhere-zero flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242967)
