Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Yongde Feng"'
Publikováno v:
Mathematics, Vol 10, Iss 9, p 1575 (2022)
A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be extended to a perfect matching. The extendability number of Γ is the maximum k such that Γ is k-extendable. In this paper, we prove that Cayley graph
Externí odkaz:
https://doaj.org/article/61c09f59b6b64e668fd602f319391fa6
Autor:
Qiongxiang Huang, Yongde Feng
Publikováno v:
Discrete Applied Mathematics. 155:2321-2327
Given a graph G, an edge-coloring of G with colors 1,2,3,… is consecutive if the colors of edges incident to each vertex are distinct and form an interval of integers. The consecutive edge-coloring of graphs has important applications in scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50ca26d06487b98009f4647d9773ddbe
https://doi.org/10.1016/j.dam.2007.06.010
https://doi.org/10.1016/j.dam.2007.06.010