Pages that link to "Item:Q4198789"

The following pages link to On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte (Q4198789):

Displaying 50 items.

• Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
• On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
• Covering a cubic graph with perfect matchings (Q393450) (← links)
• Sparsely intersecting perfect matchings in cubic graphs (Q397063) (← links)
• On T-joins and odd factors (Q579278) (← links)
• Graphs of arbitrary excessive class (Q616357) (← links)
• 1-factor covers of regular graphs (Q628309) (← links)
• Approximating the chromatic index of multigraphs (Q630193) (← links)
• Fractional total colourings of graphs of high girth (Q651031) (← links)
• Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
• Signed cycle double covers (Q668036) (← links)
• On the excessive \([m]\)-index of a tree (Q741745) (← links)
• Packing and covering of crossing families of cuts (Q789399) (← links)
• The circular chromatic index of graphs of high girth (Q858677) (← links)
• Packing six \(T\)-joins in plane graphs (Q896004) (← links)
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
• On multiples of simple graphs and Vizing's theorem (Q982630) (← links)
• Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
• A theorem in edge colouring (Q1043601) (← links)
• Polychromatic colorings of rectangular partitions (Q1043659) (← links)
• A note on Berge-Fulkerson coloring (Q1043939) (← links)
• On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
• Short proofs on the matching polyhedron (Q1050377) (← links)
• On the chromatic index of multigraphs and a conjecture of Seymour (I) (Q1084107) (← links)
• Matching structure and the matching lattice (Q1112071) (← links)
• Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
• Matchings in regular graphs (Q1155070) (← links)
• Matroids and multicommodity flows (Q1161527) (← links)
• NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
• A polyhedral approach to edge coloring (Q1180838) (← links)
• Integer flows and cycle covers (Q1186130) (← links)
• The matroids with the max-flow min-cut property (Q1245970) (← links)
• A two-commodity cut theorem (Q1250228) (← links)
• Solution of two fractional packing problems of Lovász (Q1260046) (← links)
• A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
• Edge coloring nearly bipartite graphs (Q1306362) (← links)
• How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
• Fractional and integral colourings (Q1363414) (← links)
• On fractional Ramsey numbers (Q1377687) (← links)
• The chromatic index of multigraphs of order at most 10 (Q1377876) (← links)
• Extension from precoloured sets of edges (Q1658745) (← links)
• Fair representation in dimatroids (Q1689871) (← links)
• Perfect matching covers of cubic graphs of oddness 2 (Q1732040) (← links)
• Graph edge coloring: a survey (Q1733850) (← links)
• Berge-Fulkerson coloring for infinite families of snarks (Q1734033) (← links)
• Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
• Chromatic index determined by fractional chromatic index (Q1748268) (← links)
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice (Q1850602) (← links)
• A revival of the girth conjecture (Q1880788) (← links)
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)