The Petersen graph is not 3-edge-colorable--a new proof
نویسندگان
چکیده
We give a new proof that the Petersen graph is not 3-edge-colorable. J. Petersen introduced the most well known graph, the Petersen graph, as an example of a cubic bridgeless graph that is not Tait colorable, i.e. it is not 3-edge-colorable. It is easy to see the equivalence between the following statements, but most proofs for each of them use a case by case argument [1]. Theorem 1 For the Petersen graph P the following are equivalent: (1) P is not 3-edge-colorable; (2) P is not Hamiltonian; (3) P does not admit a nowhere-zero 4-flow. Here we give a new proof of: Proposition 2 The Petersen graph is not 3-edge-colorable. ∗Supported in part by the Ministry of Science and Technology of Slovenia, Research Project Z1-3129 and by a postdoctoral fellowship of PIMS.
منابع مشابه
Uniquely Edge-3-Colorable Graphs and Snarks
A cubic graph G is uniquely edge-3-colorable if G has precisely one 1-factorization. It is proved in this paper, if a uniquely edge-3-colorable, cubic graph G is cyclically 4-edgeconnected, but not cyclically 5-edge-connected, then G must contain a snark as a minor. This is an approach to a conjecture that every triangle free uniquely edge-3-colorable cubic graph must have the Petersen graph as...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملSupereulerian Graphs and the Petersen Graph
A graph G is called even if O(G)=<, and G is called eulerian if G is even and connected. If G has a spanning eulerian subgraph, then G is called supereulerian, and we write G # SL. Tutte [19, 20] and Matthews [17] conjectured that if a 2-edge-connected graph G has no subgraph contractible to the Petersen graph, then G has a 3-colorable double cycle cover (i.e., a collection of three even subgra...
متن کاملSpiral Chains: The Proofs of Tait’s and Tutte’s Three-Edge-Coloring Conjectures
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a threeedge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the four-color conjecture at the end of the 19th century. We have also shown the applicability of our method to another well-known three edge-coloring conjecture on cub...
متن کامل5-cycles and the Petersen graph
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph. ”The Petersen graph is an obstruction to many properties in graph theory, and often is, or conjectured to be, the only obstruction”. This phrase is taken from one of the series of papers by Robertson, Sanders, Seymour and Thomas that is devoted to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 268 شماره
صفحات -
تاریخ انتشار 2003