共查询到20条相似文献,搜索用时 193 毫秒
1.
2.
3.
4.
5.
6.
7.
A graph with at least vertices is said to be distance -extendable if, for any matching of with edges in which the edges lie at distance at least pairwise, there exists a perfect matching of containing . In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 -extendable for any . 相似文献
8.
Douglas R. Woodall 《Journal of Graph Theory》2019,92(4):488-490
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree is at least if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively. 相似文献
9.
10.
11.
12.
13.
While much attention has been directed to the maximum modulus and maximum real part of chromatic roots of graphs of order (ie, with vertices), relatively little is known about the maximum imaginary part of such graphs. We prove that the maximum imaginary part can grow linearly in the order of the graph. We also show that for any fixed , almost every random graph in the Erdös-Rényi model has a nonreal root. 相似文献
14.
Win conjectured that a graph on vertices contains disjoint perfect matchings, if the degree sum of any two nonadjacent vertices is at least , where is even and . In this paper, we prove that Win's conjecture is true for , where is sufficiently large. To show this result, we prove a theorem on -factor in a graph under some Ore-type condition. Our main tools include Tutte's -factor theorem, the Karush-Kuhn-Tucker theorem on convex optimization and the solution to the long-standing 1-factor decomposition conjecture. 相似文献
15.
Martin Rolek 《Journal of Graph Theory》2020,93(4):560-565
16.
Let be an integer with and be a connected -uniform hypergraph with edges. By refining the broken cycle theorem for hypergraphs, we show that if , then the -list assignment of admitting the fewest colorings is the constant list assignment. This extends the previous results of Donner, Thomassen, and the current authors for graphs. 相似文献
17.
18.
19.