Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Quanru Pan"'
Autor:
Sizhong Zhou, Quanru Pan
Publikováno v:
AIMS Mathematics, Vol 6, Iss 2, Pp 1223-1233 (2021)
Let $G$ be a $[0,k_1+k_2+\cdots+k_m-n+1]$-digraph and $H_1,H_2,\cdots,H_r$ be $r$ vertex-disjoint $n$-subdigraphs of $G$, where $m,n,r$ and $k_i$ ($1\leq i\leq m$) are positive integers satisfying $1\leq n\leq m$ and $k_1\geq k_2\geq\cdots\geq k_m\ge
Externí odkaz:
https://doaj.org/article/c1aabc358c79449988836a877dffe6ac
Publikováno v:
Discrete Applied Mathematics. 319:183-191
A graph G is P ≥ k -factor deleted if for every edge e ∈ E ( G ) , G contains a P ≥ k -factor that excludes e . We first define the concept of ( P ≥ k , n ) -critical deleted graph, that is, a graph G is ( P ≥ k , n ) -critical deleted if f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31edb7a3ea423232f65fc8f7031de7a6
https://doi.org/10.1016/j.dam.2021.04.012
https://doi.org/10.1016/j.dam.2021.04.012
Publikováno v:
Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science; Jan-Mar2023, Vol. 24 Issue 1, p11-18, 8p