Kőnig's edge-colouring theorem for all graphs
نویسندگان
چکیده
We show that the maximum degree of a graph G is equal to theminimum number of ocm sets covering G, where an ocm set is the vertex-disjoint union of elementary odd cycles and onematching, and a collection of ocm sets covers G if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
A greedy method for edge-colouring odd maximum degree doubly chordal graphs
We describe a greedy vertex colouring method which can be used to colour optimally the edge set of certain chordal graphs. This new heuristic yields an exact edge-colouring algorithm for odd maximumdegree doubly chordal graphs. This method shows that any such graph G can be edge-coloured with maximum degree (G) colours, i.e., all these graphs are Class 1. In addition, this method gives a simple...
متن کاملEdge-Distinguishing Index of a Graph
We introduce a concept of edge-distinguishing colourings of graphs. A closed neighbourhood of an edge e ∈ E(G) is a subgraph N [e] induced by the edge e and all the edges adjacent to it. We say that a colouring c : E(G) → C distinguishes two edges e1 and e2 if there does not exist an isomorphism φ of N [e1] onto N [e2] such that φ(e1) = e2, and φ preserves colours of c. An edge-distinguishing i...
متن کاملAcyclic edge-colouring of planar graphs∗
A proper edge-colouring with the property that every cycle contains edges of at least three distinct colours is called an acyclic edge-colouring. The acyclic chromatic index of a graph G, denoted χa(G), is the minimum k such that G admits an acyclic edge-colouring with k colours. We conjecture that if G is planar and ∆(G) is large enough then χa(G) = ∆(G). We settle this conjecture for planar g...
متن کاملAcyclic edge colouring of plane graphs
A proper edge-colouring with the property that every cycle contains edges of at least three distinct colours is called an acyclic edge-colouring. The acyclic chromatic index of a graph G, denoted χa(G), is the minimum k such that G admits an acyclic edge-colouring with k colours. We conjecture that if G is planar and ∆(G) is large enough then χa(G) = ∆(G). We settle this conjecture for planar g...
متن کاملEdge Cover Colouring Versus Minimum Degree in Multigraphs
An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover meets each vertex at least once). We aim to determine a tight lower bound on the maximum number of parts in an edge cover colouring as a function of the minimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 41 شماره
صفحات -
تاریخ انتشار 2013