A sublinear bound on the chromatic index of multigraphs

Michael J. Plantholt

Type: Article

Publication Date: 1999-05-01

Citations: 12

DOI: https://doi.org/10.1016/s0012-365x(98)00356-2

View Publication

Locations

Discrete Mathematics - View

Similar Works

Action	Title	Year	Authors
+	A Combined Logarithmic Bound on the Chromatic Index of a Multigraph	2010	Michael Plantholt
+	A Combined Logarithmic Bound on the Chromatic Index of Multigraphs	2012	Michael J. Plantholt
+	The chromatic index of multigraphs of order at most 10	1997	Michael J. Plantholt Shailesh K. Tipnis
+	An upper bound on the chromatic index of multigraphs	1985	Takao Nishizeki Kenichi Kashiwagi
+	Achieving maximum chromatic index in multigraphs	2008	Jessica McDonald
+	A note on the edge cover chromatic index of multigraphs	2008	Changqing Xu Guizhen Liu
+	The chromatic index of multigraphs that are nearly full	1990	Michael J. Plantholt Shailesh K. Tipnis
+	Multigraphs with High Chromatic Index	2009	Jessica McDonald
+	The Maximum Chromatic Index of Multigraphs with Given Δ and μ	2011	Diego Scheide Michael Stiebitz
+ PDF Chat	On the coequal values of total chromatic number and chromatic index	2022	Guantao Chen Yanli Hao
+	An Upper Bound on the Fractional Chromatic Number	2012	Chun‐Hung Liu
+	On the list chromatic index of nearly bipartite multigraphs.	1999	Michael Plantholt Shailesh K. Tipnis
+	On the Multigraph Overfull Conjecture	2023	Michael Plantholt Songling Shan
+	Graphs with chromatic polynomial ∑l⩽m0lm0−l(λ)l	2002	Chengfu Ye Nian‐Zu Li
+	The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear	1992	Alexander Razborov
+ PDF Chat	Fractional chromatic number vs. Hall ratio	2024	Raphael Steiner
+	On the chromatic index of multigraphs and a conjecture of Seymour, (II)	1991	Odile Marcotte
+	Strong chromatic index of subcubic planar multigraphs	2015	Alexandr Kostochka X. Li Watcharintorn Ruksasakchai Michael Santana Tao Wang Gexin Yu
+	The chromatic index of graphs with large even order n and minimum degree at least 2n/3	2022	Michael J. Plantholt
+	Lifting of a bound for the chromatic number of ℝ n to higher dimensions	2009	Andrey Kupavskii

Works That Cite This (8)

Action	Title	Year	Authors
+	Efficiently list‐edge coloring multigraphs asymptotically optimally	2022	Fotis Iliopoulos Alistair Sinclair
+	Efficiently list-edge coloring multigraphs asymptotically optimally.	2018	Fotis Iliopoulos Alistair Sinclair
+	Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs	2019	Guantao Chen Guangming Jing Wenan Zang
+ PDF Chat	Approximating the chromatic index of multigraphs	2009	Guantao Chen Xingxing Yu Wenan Zang
+	A Combined Logarithmic Bound on the Chromatic Index of Multigraphs	2012	Michael J. Plantholt
+	A Combined Logarithmic Bound on the Chromatic Index of a Multigraph	2010	Michael Plantholt
+ PDF Chat	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps	2011	Friedrich Eisenbrand Naonori Kakimura Thomas Rothvoß Laura Sanità
+	Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps	2010	Friedrich Eisenbrand Naonori Kakimura Thomas Rothvoß Laura Sanità

Works Cited by This (4)

Action	Title	Year	Authors
+	On the chromatic index of multigraphs and a conjecture of Seymour (I)	1986	Odile Marcotte
+	Asymptotics of the Chromatic Index for Multigraphs	1996	Jeff Kahn
+	Edge‐coloring of multigraphs: Recoloring technique	1984	Mark Goldberg
+	An upper bound on the chromatic index of multigraphs	1985	Takao Nishizeki Kenichi Kashiwagi