Topic
Edge coloring
About: Edge coloring is a research topic. Over the lifetime, 3688 publications have been published within this topic receiving 63664 citations.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: It is shown that it is NP-complete to determine the chromatic index of an arbitrary graph, even for cubic graphs.
Abstract: We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.
1,373 citations
TL;DR: The natural conjecture, formulated in several sources, asserts that the H-coloring problem is NP-complete for any non-bipartite graph H, and a proof of this conjecture is given.
886 citations
TL;DR: In this paper, it was shown that the complement of a perfect graph is perfect and a new proof for a related theorem of Berge and Las Vergnas was given for integer valued linear programming.
786 citations
TL;DR: Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected subgraphs maxunal with respect to their minimum degree can be determined in O(I EI + I VI) time and 21El + O (I VI) space.
Abstract: Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected subgraphs maxunal with respect to their minimum degree can be determined in O(I EI + I VI) time and 21El + O(I VI) space It is further noted that the smallest-last graph coloring algonthrn can be unplemented in O(I E I + I V[) tune, and particularly effective aspects of the resulting coloring are discussed.
595 citations
TL;DR: The statement of the title is proved, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L. Rubin, and H Taylor.
594 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 31 |
| 2024 | 64 |
| 2023 | 153 |
| 2022 | 259 |
| 2021 | 113 |
| 2020 | 125 |