Extending a partial nowhere-zero 4-flow

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199904)30:4<277::AID-JGT3>3.0.CO;2-D" /><277::AID-JGT3>3.0.CO;2-D 10.1002/(SICI)1097-0118(199904)30:4<277::AID-JGT3>3.0.CO;2-DzbMath0920.05023OpenAlexW4253136899MaRDI QIDQ4238042

Hong-Jian Lai

Publication date: 10 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199904)30:4<277::aid-jgt3>3.0.co;2-d

zbMATH Keywords

strong embeddingcollapsible graphspanning trees4-flowflow extension

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Group connectivity of graphs with diameter at most 2 ⋮ Group connectivity of complementary graphs ⋮ Extendability of contractible configurations for nowhere-zero flows and modulo orientations ⋮ Group connectivity in 3-edge-connected graphs ⋮ Eulerian subgraphs and \(S\)-connectivity of graphs ⋮ Group connectivity under 3‐edge‐connectivity ⋮ On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Degree conditions for group connectivity ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Group connectivity and matchings

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending a partial nowhere-zero 4-flow