Approximating the chromatic index of multigraphs

@article{Chen2011ApproximatingTC,
  title={Approximating the chromatic index of multigraphs},
  author={Guantao Chen and Xingxing Yu and Wenan Zang},
  journal={Journal of Combinatorial Optimization},
  year={2011},
  volume={21},
  pages={219-246}
}
  • Guantao Chen, Xingxing Yu, Wenan Zang
  • Published 2011
  • Mathematics, Computer Science
  • Journal of Combinatorial Optimization
AbstractIt is well known that if G is a multigraph then χ′(G)≥χ′*(G):=max {Δ(G),Γ(G)}, where χ′(G) is the chromatic index of G, χ′*(G) is the fractional chromatic index of G, Δ(G) is the maximum degree of G, and Γ(G)=max {2|E(G[U])|/(|U|−1):U⊆V(G),|U|≥3, |U| is odd}. The conjecture that χ′(G)≤max {Δ(G)+1,⌈Γ(G)⌉} was made independently by Goldberg (Discret. Anal. 23:3–7, 1973), Anderson (Math. Scand. 40:161–175, 1977), and Seymour (Proc. Lond. Math. Soc. 38:423–460, 1979). Using a probabilistic… Expand
On characterizing Vizing's edge colouring bound
TLDR
It is shown that if µ is bounded below by a logarithmic function of Δ, then G attains Vizing's bound if and only if there exists an odd subset S⊆V(G) with |S|≥3, such that |E[S]|>((|S| − 1)/2)(Δ + µ − 1). Expand
BEYOND THE VIZING'S BOUND FOR AT MOST SEVEN COLORS ∗
Let G =( V,E) be a simple graph of maximum degree Δ. The edges of G can be colored with at most Δ + 1 colors by Vizing's theorem. We study lower bounds on the size of subgraphs of G that can beExpand
Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs
Given a multigraph $G=(V,E)$, the {\em edge-coloring problem} (ECP) is to color the edges of $G$ with the minimum number of colors so that no two adjacent edges have the same color. This problem canExpand
On the edge coloring of graphs
In this thesis, we consider the problem posed by Gupta, Goldberg and Seymour: “When is the chromatic index χ′ of a graph almost the same as its fractional chromatic index χ′∗?”. While theyExpand
Orientation-based edge-colorings and linear arboricity of multigraphs
The Goldberg-Seymour Conjecture for f -colorings states that the f -chromatic index of a loopless multigraph is essentially determined by either a maximum degree or a maximum density parameter. WeExpand
Structural properties of edge-chromatic critical multigraphs
  • Guantao Chen, Guangming Jing
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 2019
Appearing in different format, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) conjectured that if $G$ is an edge-$k$-critical graph with $k \ge \Delta +1$, then $|V(G)|$ isExpand
Goldberg's conjecture is true for random multigraphs
TLDR
It is shown that if $n$ is even and $m:=m(n)$, then $\chi'(M)=\Delta(M)$ for a typical $M\sim M(n,m)$, and that, for a given $m, M typically satisfies $\chi’(G),\lceil\rho(G)$. Expand
On the Total Proper Connection of Graphs
The total-coloring of a graph is a coloring of the edge set and vertex set. A path in a total-colored graph is a total proper path if the coloring of the edges and internal vertices is proper, thatExpand
Beyond the Vizing's Bound for at Most Seven Colors
TLDR
Lower bounds on the size of subgraphs of G that can be colored with at most $\Delta +1$ colors are studied and a new bound for subcubic multigraphs not isomorphic to $K_3$ with one edge doubled is shown. Expand
Fractional Edge and Total Colouring
Many problems which seek to schedule, sequence, or time-table a set of events subject to given constraints can be modelled as graph colouring problems. In this thesis, we study the edge and totalExpand
...
1
2
...

References

SHOWING 1-10 OF 66 REFERENCES
On the chromatic index of multigraphs and a conjecture of Seymour (I)
  • O. Marcotte
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1986
TLDR
Seymour's conjecture can be reduced to a conjecture about critical nonseparable graphs (in the sense of matching theory) and the latter conjecture is verified in the case of outerplanar graphs, thus proving that Seymour's conjecture holds for outerplanars graphs. Expand
On the chromatic index of multigraphs without large triangles
  • H. Kierstead
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1984
Let M be a multigraph. Vizing (Kibernetika (Kiev) 1 (1965), 29–39) proved that χ′(M)≤Δ(M)+μ(M). Here it is proved that if χ′(M)≥Δ(M)+s, where 12(μ(M) + 1) < s then M contains a 2s-sided triangle. InExpand
A sublinear bound on the chromatic index of multigraphs
TLDR
It is shown that for any real b, 2 3 ⩽ b, the chromatic index of G exceeds φ(G) by at most max{log1/b n, 1 + n(1 − b)/10}. Expand
On the 1.1 Edge-Coloring of Multigraphs
TLDR
The proof yields an algorithm which edge-colors any given multigraph G with at most $\lfloor 1.1q^* ( G ) + 0.8 \rfloor $ colors. Expand
Asymptotics of the Chromatic Index for Multigraphs
  • J. Kahn
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 1996
TLDR
Of particular interest in the present proof is the use of probabilistic ideas and “hard-core” distributions to go from fractional to ordinary (integer) colorings. Expand
On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, l)-functions on the set of edges, the constant function 1 cannot beExpand
Improving a Family of Approximation Algorithms to Edge Color Multigraphs
TLDR
It is easily shown that the (2k-3)/2k term cannot be reduced further, unless P=NP, and this result can be used to extend the set of cases in which well-known conjectures on ECP are valid. Expand
A Better than "Best Possible" Algorithm to Edge Color Multigraphs
TLDR
This paper presents an algorithm to find an edge coloring of a multigraph that never uses more than ⌊ 9 8 χ′ + 3 4 ⌋ colors and runs in O(|E|(|V| + Δ)) time, where E is the set of edges, and V is theSet of vertices. Expand
Maximum matching and a polyhedron with 0,1-vertices
TLDR
The emphasis in this paper is on relating the matching problem to the theory of continuous linear programming, and the algorithm described does not involve any "blind-alley programming" -which, essentially, amounts to testing a great many combinations. Expand
An asymptotic approximation scheme for multigraph edge coloring
TLDR
This work gives polynomial time algorithms for approximate edge coloring of multigraphs, i.e., parallel edges are allowed, and achieves arbitrarily good approximation factors at the cost of slightly larger additive terms. Expand
...
1
2
3
4
5
...