On (k,d)-colorings and fractional nowhere-zero flows
From MaRDI portal
Publication:4242967
DOI10.1002/(SICI)1097-0118(199807)28:3%3C155::AID-JGT5%3E3.0.CO;2-JzbMATH Open0922.05027OpenAlexW4246110625MaRDI QIDQ4242967FDOQ4242967
Authors: Michael Tarsi, Cun-Quan Zhang, Luis Goddyn 
Publication date: 11 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199807)28:3%3C155::aid-jgt5%3E3.0.co;2-j
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
combinatorial optimizationgreedy algorithmregular matroidsstar chromatic numberfractional nowhere-zero flows
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Cited In (60)
- Circular flow number of Goldberg snarks
- Spectral radius and edge‐disjoint spanning trees
- Ban–Linial's Conjecture and treelike snarks
- Some snarks are worse than others
- Matroid invariants and counting graph homomorphisms
- Homomorphisms of Cayley graphs and cycle double covers
- Circular flows in planar graphs
- Spanning triangle-trees and flows of graphs
- Resource-sharing systems and hypergraph colorings
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Snarks with given real flow numbers
- Bicircular matroids are 3-colorable
- Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
- 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
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- Circular chromatic numbers of Mycielski's graphs
- The flow index of regular class I graphs
- Antisymmetric flows in matroids
- On the chromatic number of an oriented matroid
- The Set of Circular Flow Numbers of Regular Graphs
- The flow index and strongly connected orientations
- 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
- Short cycle covers of graphs and nowhere-zero flows
- Measures of edge-uncolorability of cubic graphs
- Cubic graphs that cannot be covered with four perfect matchings
- Circular flow on signed graphs
- Nearly nowhere-zero \(r\)-flow graphs
- Integer flows and modulo orientations of signed graphs
- A connection between circular colorings and periodic schedules
- The circular chromatic number of induced subgraphs
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Computational results and new bounds for the circular flow number of snarks
- Contractible graphs for flow index less than three
- A unified approach to construct snarks with circular flow number 5
- Star chromatic numbers of graphs
- Resource-sharing system scheduling and circular chromatic number
- On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
- Circular colouring and orientation of graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Flows, flow-pair covers and cycle double covers
- 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
- Perfect matching index versus circular flow number of a cubic graph
- Flows on signed graphs without long barbells
- Circular flow numbers of regular multigraphs
- Circular zero-sum \(r\)-flows of regular graphs
- Edge colorings and circular flows on regular graphs
- Extending precolorings to circular colorings
- Complementary graphs with flows less than three
- The circular chromatic number of hypergraphs
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs
- 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)
