Flow-Critical Graphs

DOI10.1016/J.ENDM.2008.01.029MaRDI QIDQ3503546zbMATH OpenOpenAlexFDO

Authors Cândida Nunes da Silva, Cláudio L. Lucchesi

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.029

zbMATH Keywords

edge-\(k\)-critical graphsnowhere-zero \(k\)-flowsTutte's flow conjecturesvertex-\(k\)-critical graphs

Mathematics Subject Classification ID

Flows in graphs (05C21)

Recommendations

• On 3-flow-critical graphs
• 3-flows and combs
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• About Counterexamples to The 5-Flow Conjecture
• Tutte's 5-flow conjecture for graphs of nonorientable genus 5

Cites work

• An equivalent version of the 3-flow conjecture
• scientific article; zbMATH DE number 3754754 (Why is no real title available?)
• scientific article; zbMATH DE number 863473 (Why is no real title available?)
• scientific article; zbMATH DE number 4187837 (Why is no real title available?)
• Integer flows
• Tutte's edge-colouring conjecture

Cited in

(11)

• On 3-flow-critical graphs
• Coloring drawings of graphs
• Morphology of small snarks
• Critical and flow-critical snarks coincide
• A faster test for 4-flow-criticality in snarks
• Hypohamiltonian snarks have a 5-flow
• scientific article; zbMATH DE number 3914356 (Why is no real title available?)
• scientific article; zbMATH DE number 978220 (Why is no real title available?)
• On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
• Measures of edge-uncolorability of cubic graphs
• Strictly critical snarks with girth or cyclic connectivity equal to 6

This page was built for publication: Flow-Critical Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503546)