Polyhedral decompositions of cubic graphs
From MaRDI portal
Publication:5661524
DOI10.1017/S0004972700042660zbMath0249.05111OpenAlexW2073039945WikidataQ55879889 ScholiaQ55879889MaRDI QIDQ5661524
Publication date: 1973
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700042660
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (88)
5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ On snarks that are far from being 3-edge colorable ⋮ Oddness to resistance ratios in cubic graphs ⋮ Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Cycle double covers of graphs with Hamilton paths ⋮ Hamilton weights and Petersen minors ⋮ Unnamed Item ⋮ On spanning disjoint paths in line graphs ⋮ A note on shortest cycle covers of cubic graphs ⋮ The construction and reduction of strong snarks ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ On Perfect Matching Coverings and Even Subgraph Coverings ⋮ 3-critical subgraphs of snarks ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings ⋮ Cycle Double Covers in Cubic Graphs having Special Structures ⋮ Total dual dyadicness and dyadic generating sets ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ On the simultaneous edge coloring of graphs ⋮ The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ On semiextensions and circuit double covers ⋮ Strong Circuit Double Cover of Some Cubic Graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ Circuit extension and circuit double cover of graphs ⋮ Short signed circuit covers of signed graphs ⋮ On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph ⋮ A model for finding transition-minors ⋮ Cycle double covers and the semi-Kotzig frame ⋮ Small cycle cover of 2-connected cubic graphs ⋮ Construction of class two graphs with maximum vertex degree three ⋮ On the existence of graphs which can colour every regular graph ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ Even polyhedral decompositions of cubic graphs ⋮ Reducible 3-critical graphs ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ Finite edge-transitive oriented graphs of valency four: a global approach ⋮ On vertex-parity edge-colorings ⋮ Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ On 2-factors with a bounded number of odd components ⋮ Odd 2-factored snarks ⋮ Representativity of Cayley maps ⋮ Reducible configurations for the cycle double cover conjecture ⋮ Even circuits in planar graphs ⋮ Generation and properties of snarks ⋮ Kotzig frames and circuit double covers ⋮ Spanning trees: A survey ⋮ Signed circuit cover of bridgeless signed graphs ⋮ Cycles in weighted graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Signed cycle double covers ⋮ Integer flows and cycle covers ⋮ Integer 4-flows and cycle covers ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Cuboids, a class of clutters ⋮ On cycle double covers of line graphs ⋮ Hajós' conjecture and small cycle double covers of planar graphs ⋮ On the smallest snarks with oddness 4 and connectivity 2 ⋮ A bound on the total size of a cut cover ⋮ Cycle double covers and spanning minors. I ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Cycle double covers and spanning minors. II ⋮ Graphs with the Circuit Cover Property ⋮ Homomorphisms of Cayley graphs and cycle double covers ⋮ Weak embedding of planar graphs ⋮ Cycle double covers of infinite planar graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ The k-conversion number of regular graphs ⋮ Colouring problems ⋮ Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits ⋮ Strong 5-cycle double covers of graphs ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor ⋮ ON NORMALIZATIONS OF A REGULAR ISOTOPY INVARIANT FOR SPATIAL GRAPHS ⋮ Cycle double covers and non-separating cycles ⋮ A note on antisymmetric flows in graphs ⋮ Small cycle double covers of products. II: Categorical and strong products with paths and cycles ⋮ A note on Berge-Fulkerson coloring ⋮ Flows, flow-pair covers and cycle double covers ⋮ Computational results and new bounds for the circular flow number of snarks ⋮ Classification and characterizations of snarks ⋮ Circuit Double Covers of Graphs ⋮ A note about shortest cycle covers ⋮ Small cycle double covers of 4-connected planar graphs ⋮ Cycle‐Continuous Mappings—Order Structure
Cites Work
This page was built for publication: Polyhedral decompositions of cubic graphs
