Asymptotics of the chromatic index for multigraphs
From MaRDI portal
Publication:1125951
DOI10.1006/jctb.1996.0067zbMath0861.05026OpenAlexW2044004462MaRDI QIDQ1125951
Publication date: 19 May 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0067
multigraphhypergraphschromatic indexcoloringsmaximum degreematching polytopefractional chromatic indexhard-core distributionsincremental -random method
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (25)
On a limit of the method of Tashkinov trees for edge-colouring ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Extension from precoloured sets of edges ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Approximating the chromatic index of multigraphs ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Graph edge coloring: a survey ⋮ A superlocal version of Reed's conjecture ⋮ An upper bound for the chromatic number of line graphs ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ Chromatic index determined by fractional chromatic index ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ Edge coloring multigraphs without small dense subsets ⋮ On the stochastic independence properties of hard-core distributions ⋮ Goldberg's conjecture is true for random multigraphs ⋮ A Characterization of Graphs with Fractional Total Chromatic Number Equal to ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ A sublinear bound on the chromatic index of multigraphs ⋮ Edge coloring nearly bipartite graphs
This page was built for publication: Asymptotics of the chromatic index for multigraphs
