Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Shiyou Pang"'
Publikováno v:
Discrete Applied Mathematics. 229:113-120
Let G be a simple connected graph. The eccentric distance sum (EDS) of G is defined as ξ d ( G ) = ∑ v ∈ V e G ( v ) D G ( v ) , where e G ( v ) is the eccentricity of the vertex v and D G ( v ) = ∑ u ∈ V d G ( u , v ) is the sum of all dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e18e808cdbf42c327c127c72875c900
https://doi.org/10.1016/j.dam.2017.04.032
https://doi.org/10.1016/j.dam.2017.04.032
Publikováno v:
Discrete Applied Mathematics. 186:199-206
Let G be a simple connected graph. The eccentric distance sum (EDS) of G is defined as ξ d ( G ) = ∑ v ∈ V e G ( v ) D G ( v ) , where e G ( v ) is the eccentricity of the vertex v and D G ( v ) = ∑ u ∈ V d G ( u , v ) is the sum of all dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10dfcaf0cc10a73f585641de948ce2a0
https://doi.org/10.1016/j.dam.2015.01.042
https://doi.org/10.1016/j.dam.2015.01.042
Autor:
Shiyou Pang1 615595479@qq.com, Lianying Miao2 miaolianying@cumt.edu.cn, Wenyao Song1 2408955057@qq.com, Zhengke Miao2 zkmiao@163.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2014, Vol. 34 Issue 3, p577-584. 8p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 577-584 (2014)
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree ∆ and independence number α(G), α(G) ≤ |V | 2 . It is known that α(G) < 3∆−2 5∆−2 |V |. In this paper we improve this bound when ∆
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be70e45a0b661dc3dc5beec55726916a
https://doaj.org/article/becf8327da144f80bd83ffb4561711aa
https://doaj.org/article/becf8327da144f80bd83ffb4561711aa
Publikováno v:
Discrete Mathematics. 325:17-22
In this paper, we prove that every graph with maximum degree six is acyclically 10-colorable, thus improving the main result of Herve Hocquard (2011).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef9c8f506bc16419f48fa19dca764841
https://doi.org/10.1016/j.disc.2014.01.022
https://doi.org/10.1016/j.disc.2014.01.022
Publikováno v:
International Journal of Computer Mathematics. 91:2142-2151
In this paper, we give some new properties of edge chromatic critical graphs, and give new lower bounds for the average degree of Δ-critical graphs with Δ=11, 12 by the use of these properties.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::853001fd9007007e7b06ca66309d19b2
https://doi.org/10.1080/00207160.2014.883068
https://doi.org/10.1080/00207160.2014.883068
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :121-125
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Hadwiger conjectures that every k-chromatic graph contains Kk as a minor. It implies that every graph G on n vertices has a [Formula: see text] as a min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eff86e624fb2799289d9e379fd265db4
https://doi.org/10.1142/s1793830909000026
https://doi.org/10.1142/s1793830909000026
Autor:
Lianying Miao, Shiyou Pang
Publikováno v:
Discrete Mathematics. 308(23):5856-5859
In 1968, Vizing proposed the following conjecture: If G=(V,E) is a @D-critical graph of order n and size m, then m>=12[(@D-1)n+3]. This conjecture has been verified for the cases of @[email protected]?5. In this paper, we prove that m>=74n when @D=4.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e53f6780eb489b94fb10fd6008a4fb05