4-chromatic edge critical Grötzsch–Sachs graphs
نویسندگان
چکیده
منابع مشابه
Edge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملA Class of Edge Critical 4-Chromatic Graphs
We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n;,: 7, G has n vertices and three matching edges (it is also 8n ) shown that such graphs must have at leas...
متن کاملIndependent sets and 2-factors in edge-chromatic-critical graphs
In 1968, Vizing made the following two conjectures for graphs which are critical with respect to the chromatic index: (1) every critical graph has a 2-factor, and (2) every independent vertex set in a critical graph contains at most half of the vertices. We prove both conjectures for critical graphs with many edges, and determine upper bounds for the size of independent vertex sets in those gra...
متن کاملSubcubic Edge-Chromatic Critical Graphs Have Many Edges
We consider graphs G with ∆ = 3 such that χ′(G) = 4 and χ′(G− e) = 3 for every edge e, so-called critical graphs. Jakobsen noted that the Petersen graph with a vertex deleted, P ∗, is such a graph and has average degree only 2 + 2 3 . He showed that every critical graph has average degree at least 2+ 23 , and asked if P ∗ is the only graph where equality holds. We answer his question affirmativ...
متن کاملRemarks on the size of critical edge-chromatic graphs
We give new lower bounds for the size of A-critical edge-chromatic graphs when 6~<A ~<21. 1. I n t r o d u c t i o n All graphs we consider are undirected and have neither loops nor multiple edges. We denote the vertex set of a graph G by V(G) and the edge set by E(G). The order of G is I V(G)I and the size of G is IE(G)I. We denote the degree of a vertex v in G by de(v) and the maximum degree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.06.006