On (k,d)-colorings and fractional nowhere-zero flows
From MaRDI portal
Publication:4242967
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199807)28:3<155::AID-JGT5>3.0.CO;2-J" /><155::AID-JGT5>3.0.CO;2-J 10.1002/(SICI)1097-0118(199807)28:3<155::AID-JGT5>3.0.CO;2-JzbMath0922.05027OpenAlexW4246110625MaRDI QIDQ4242967
Cun-Quan Zhang, Michael Tarsi, Luis A. Goddyn
Publication date: 11 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199807)28:3<155::aid-jgt5>3.0.co;2-j
combinatorial optimizationgreedy algorithmstar chromatic numberregular matroidsfractional nowhere-zero flows
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (59)
Bicircular matroids are 3-colorable ⋮ Packing spanning trees in highly essentially connected graphs ⋮ The circular chromatic number of induced subgraphs ⋮ Antisymmetric flows in matroids ⋮ Determining the circular flow number of a cubic graph ⋮ Spanning triangle-trees and flows of graphs ⋮ Circular flow numbers of regular multigraphs ⋮ The Flow Index of Regular Class I Graphs ⋮ Unnamed Item ⋮ A unified approach to construct snarks with circular flow number 5 ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Edge colorings and circular flows on regular graphs ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph ⋮ Circular zero-sum \(r\)-flows of regular graphs ⋮ Resource-sharing systems and hypergraph colorings ⋮ Circular flow number of Goldberg snarks ⋮ Contractible graphs for flow index less than three ⋮ Some snarks are worse than others ⋮ Circular flows via extended Tutte orientations ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nearly nowhere-zero \(r\)-flow graphs ⋮ Real flow number and the cycle rank of a graph ⋮ Flows on Signed Graphs without Long Barbells ⋮ Circular flow on signed graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ On the chromatic number of an oriented matroid ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ The flow index and strongly connected orientations ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Extending precolorings to circular colorings ⋮ Homomorphisms of Cayley graphs and cycle double covers ⋮ Treelike snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Coloring-flow duality of embedded graphs ⋮ Circular Flows in Planar Graphs ⋮ Complementary graphs with flows less than three ⋮ The circular altitude of a graph ⋮ Snarks with given real flow numbers ⋮ A connection between circular colorings and periodic schedules ⋮ Chromatic number and orientations of graphs and signed graphs ⋮ Short cycle covers of graphs and nowhere-zero flows ⋮ The Set of Circular Flow Numbers of Regular Graphs ⋮ Star chromatic numbers of graphs ⋮ Perfect Matching Index versus Circular Flow Number of a Cubic Graph ⋮ Flows, flow-pair covers and cycle double covers ⋮ The circular chromatic number of hypergraphs ⋮ Computational results and new bounds for the circular flow number of snarks ⋮ Edge Colorings and Circular Flow Numbers of Regular Graphs ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ High-girth graphs avoiding a minor are nearly bipartite ⋮ Circular colouring and orientation of graphs ⋮ Planar graphs with circular chromatic numbers between 3 and 4 ⋮ Circular flow number of highly edge connected signed graphs ⋮ Matroid invariants and counting graph homomorphisms ⋮ Circular flows of nearly Eulerian graphs and vertex-splitting
This page was built for publication: On (k,d)-colorings and fractional nowhere-zero flows
