On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
From MaRDI portal
Publication:4198789
DOI10.1112/plms/s3-38.3.423zbMath0411.05037OpenAlexW2059233598WikidataQ56390709 ScholiaQ56390709MaRDI QIDQ4198789
Publication date: 1979
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-38.3.423
Related Items
A Combined Logarithmic Bound on the Chromatic Index of Multigraphs, An Upper Bound for the Excessive Index of an r‐Graph, Berge–Fulkerson coloring for C(12)‐linked permutation graphs, A note on Goldberg's conjecture on total chromatic numbers, On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph, Edge coloring graphs with large minimum degree, Orientation‐based edge‐colorings and linear arboricity of multigraphs, Short Fans and the 5/6 Bound for Line Graphs, Deciding whether four perfect matchings can cover the edges of a snark is NP-complete, Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs, On Gupta’s Codensity Conjecture, Unions of perfect matchings in \(r\)-graphs, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks, Polychromatic colorings of plane graphs, Graphs which are vertex‐critical with respect to the edge‐chromatic class, S_12 and P_12-colorings of cubic graphs, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, A brief history of edge-colorings – with personal reminiscences, The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree, The number of disjoint perfect matchings in semi-regular graphs, How to find overfull subgraphs in graphs with large maximum degree, Overfull conjecture for graphs with high minimum degree, A revival of the girth conjecture, On the chromatic index of multigraphs and a conjecture of Seymour (I), On Dyadic Fractional Packings of $T$-Joins, Improving a family of approximation algorithms to edge color multigraphs, On a limit of the method of Tashkinov trees for edge-colouring, On a theorem of Goldberg, Binary group and Chinese postman polyhedra, Colouring series-parallel graphs, On Perfect Matching Coverings and Even Subgraph Coverings, The circular chromatic index of graphs of high girth, Fractional and integral colourings, Clean Clutters and Dyadic Fractional Packings, Matching structure and the matching lattice, Extension from precoloured sets of edges, Covering a cubic graph by 5 perfect matchings, Total dual dyadicness and dyadic generating sets, Chromatic index of dense quasirandom graphs, Hyperbolic surface subgroups of one-ended doubles of free groups, On fractional Ramsey numbers, The chromatic index of multigraphs of order at most 10, Applications of edge coloring of multigraphs to vertex coloring of graphs, Connectivity of orientations of 3-edge-connected graphs, Co-density and fractional edge cover packing, Fair representation in the intersection of two matroids, The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \), Covering a cubic graph with perfect matchings, Overfullness of critical class 2 graphs with a small core degree, The Flow Index of Regular Class I Graphs, Graphs of arbitrary excessive class, Sparsely intersecting perfect matchings in cubic graphs, Fair representation in dimatroids, Packing six \(T\)-joins in plane graphs, 1-factor covers of regular graphs, Approximating the chromatic index of multigraphs, Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees, How to build a brick, Matchings in regular graphs, Matroids and multicommodity flows, Densities, Matchings, and Fractional Edge-Colorings, Fractional total colourings of graphs of high girth, Excluding Minors in Cubic Graphs, Fulkerson's conjecture and Loupekine snarks, NP-completeness of edge-colouring some restricted graphs, Perfect matching covers of cubic graphs of oddness 2, A polyhedral approach to edge coloring, Graph edge coloring: a survey, Berge-Fulkerson coloring for infinite families of snarks, Measures of edge-uncolorability of cubic graphs, Signed cycle double covers, Integer flows and cycle covers, Circuit decompositions and shortest circuit coverings of hypergraphs, Chromatic index determined by fractional chromatic index, Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs, Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction, Graph edge colouring: Tashkinov trees and Goldberg's conjecture, On multiples of simple graphs and Vizing's theorem, Solution of two fractional packing problems of Lovász. (Reprint), On T-joins and odd factors, Berge-Fulkerson coloring for some families of superposition snarks, The matroids with the max-flow min-cut property, A two-commodity cut theorem, Edge coloring multigraphs without small dense subsets, Cubic graphs that cannot be covered with four perfect matchings, Berge-Fulkerson conjecture on certain snarks, On the excessive \([m\)-index of a tree], Optimal edge-coloring with edge rate constraints, Solution of two fractional packing problems of Lovász, High-girth cubic graphs are homomorphic to the Clebsch graph, The smallest nontrivial snarks of oddness 4, Normal 6-edge-colorings of some bridgeless cubic graphs, On Sylvester Colorings of Cubic Graphs, Achieving maximum chromatic index in multigraphs, Goldberg's conjecture is true for random multigraphs, 1‐Factor and Cycle Covers of Cubic Graphs, A Characterization of Graphs with Fractional Total Chromatic Number Equal to, On characterizing Vizing's edge colouring bound, Perfect Matching Index versus Circular Flow Number of a Cubic Graph, A theorem in edge colouring, Polychromatic colorings of rectangular partitions, A note on Berge-Fulkerson coloring, On Vizing's bound for the chromatic index of a multigraph, On a Conjecture of Fan and Raspaud, Short proofs on the matching polyhedron, Packing and covering of crossing families of cuts, A sublinear bound on the chromatic index of multigraphs, Vizing's and Shannon's theorems for defective edge colouring, Structural properties of edge-chromatic critical multigraphs, Optimal ear decompositions of matching covered graphs and bases for the matching lattice, Edge coloring nearly bipartite graphs, Normal 5-edge-colorings of a family of Loupekhine snarks, A note about shortest cycle covers, On the coequal values of total chromatic number and chromatic index, Fulkerson-covers of hypohamiltonian graphs, Unions of perfect matchings in cubic graphs, Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs, A class of cubic graphs satisfying Berge conjecture, Idealness of \(k\)-wise intersecting families
