Fulkerson's conjecture and circuit covers
From MaRDI portal
Publication:1328394
DOI10.1006/jctb.1994.1039zbMath0811.05053OpenAlexW2013356944MaRDI QIDQ1328394
Publication date: 3 May 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1039
bridgeless graphboundperfect matchingsbridgesalgebraic cyclecycle coverFulkerson's conjecturecircuit covers
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Shortest circuit covers of signed graphs, A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface, Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture, Short cycle covers of cubic graphs, Girth, oddness, and colouring defect of snarks, The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks, On even cycle decompositions of line graphs of cubic graphs, Three-matching intersection conjecture for perfect matching polytopes of small dimensions, Sparsely intersecting perfect matchings in cubic graphs, Berge–Fulkerson coloring for C(12)‐linked permutation graphs, Ban–Linial's Conjecture and treelike snarks, Decomposing plane cubic graphs, Cores, joins and the Fano-flow conjectures, Core index of perfect matching polytope for a 2-connected cubic graph, Petersen Cores and the Oddness of Cubic Graphs, Cubic graphs with colouring defect 3, On the existence of graphs which can colour every regular graph, Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs, Some snarks are worse than others, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching, Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks, A survey of graph coloring - its types, methods and applications, Perfect matching covers of cubic graphs of oddness 2, An equivalent formulation of the Fan-Raspaud Conjecture and related problems, Berge-Fulkerson coloring for infinite families of snarks, Measures of edge-uncolorability of cubic graphs, Signed cycle double covers, Integer 4-flows and cycle covers, Circuit decompositions and shortest circuit coverings of hypergraphs, On two consequences of Berge–Fulkerson conjecture, Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction, On Compatible Normal Odd Partitions in Cubic Graphs, Perfect matchings with restricted intersection in cubic graphs, Decompositions of cubic traceable graphs, Berge-Fulkerson coloring for some families of superposition snarks, Cubic graphs that cannot be covered with four perfect matchings, Berge-Fulkerson conjecture on certain snarks, Projective, affine, and abelian colorings of cubic graphs, 1‐Factor and Cycle Covers of Cubic Graphs, Short cycle covers of graphs and nowhere-zero flows, A note on Berge-Fulkerson coloring, On a Conjecture of Fan and Raspaud, Towards obtaining a 3-decomposition from a perfect matching, On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph, A note about shortest cycle covers, Abelian Colourings of Cubic Graphs, Non-intersecting perfect matchings in cubic graphs (Extended abstract), Fano colourings of cubic graphs and the Fulkerson conjecture
