Pages that link to "Item:Q4242967"

The following pages link to On (k,d)-colorings and fractional nowhere-zero flows (Q4242967):

Displaying 50 items.

• Matroid invariants and counting graph homomorphisms (Q252626) (← links)
• Bicircular matroids are 3-colorable (Q271597) (← links)
• Resource-sharing systems and hypergraph colorings (Q411210) (← links)
• Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
• Nearly nowhere-zero \(r\)-flow graphs (Q449109) (← links)
• Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
• Circular flow on signed graphs (Q651035) (← links)
• Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
• Treelike snarks (Q727053) (← links)
• Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
• Antisymmetric flows in matroids (Q852703) (← links)
• On the chromatic number of an oriented matroid (Q933674) (← links)
• Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
• A connection between circular colorings and periodic schedules (Q1028150) (← links)
• Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
• The circular chromatic number of hypergraphs (Q1045069) (← links)
• Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
• Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
• Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
• The flow index and strongly connected orientations (Q1746575) (← links)
• Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
• High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
• Circular colouring and orientation of graphs (Q1850626) (← links)
• The circular chromatic number of induced subgraphs (Q1880798) (← links)
• Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
• Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
• Circular zero-sum \(r\)-flows of regular graphs (Q2191265) (← links)
• Contractible graphs for flow index less than three (Q2198393) (← links)
• Circular flows via extended Tutte orientations (Q2200925) (← links)
• Complementary graphs with flows less than three (Q2305923) (← links)
• Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
• Circular flow number of highly edge connected signed graphs (Q2343288) (← links)
• Extending precolorings to circular colorings (Q2496199) (← links)
• Star chromatic numbers of graphs (Q2563519) (← links)
• Determining the circular flow number of a cubic graph (Q2656904) (← links)
• Spanning triangle-trees and flows of graphs (Q2657050) (← links)
• Circular flow numbers of regular multigraphs (Q2708793) (← links)
• Snarks with given real flow numbers (Q3096956) (← links)
• Short cycle covers of graphs and nowhere-zero flows (Q3106270) (← links)
• Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192) (← links)
• Real flow number and the cycle rank of a graph (Q3528156) (← links)
• The circular altitude of a graph (Q4622623) (← links)
• (Q4990130) (← links)
• Perfect Matching Index versus Circular Flow Number of a Cubic Graph (Q4997131) (← links)
• The Flow Index of Regular Class I Graphs (Q5099102) (← links)
• Flows on Signed Graphs without Long Barbells (Q5128510) (← links)
• Circular Flows in Planar Graphs (Q5216780) (← links)
• Edge Colorings and Circular Flow Numbers of Regular Graphs (Q5251196) (← links)
• Coloring-flow duality of embedded graphs (Q5461372) (← links)
• The Set of Circular Flow Numbers of Regular Graphs (Q5495888) (← links)