平静生活
发表于 2025-3-30 11:26:57
Some Topics on Edge-Coloring,In this paper some new results on edge coloring of graphs are introduced. This paper deals mainly with edge cover coloring, .-edge cover coloring, (., .)-coloring and equitable edge coloring. Some new problems and conjectures are presented.
GULF
发表于 2025-3-30 13:40:05
Discrete Geometry, Combinatorics and Graph Theory978-3-540-70666-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
inundate
发表于 2025-3-30 18:16:31
0302-9743 Overview: 978-3-540-70665-6978-3-540-70666-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
多骨
发表于 2025-3-30 21:06:12
http://reply.papertrans.cn/29/2812/281130/281130_54.png
薄荷醇
发表于 2025-3-31 02:58:16
Christopher S. Tang,Kumar Rajaram,Jihong Oudjacent or incident in .. In this paper, we show that the complement of total graph .(.) of a simple graph . is hamiltonian if and only if . is not isomorphic to any graph in {. .| . ≥ 1} ∪ {. . + . .| . ≥ 1} ∪ {. . + .| . ≥ 2} ∪ {. . + 2. ., . . + ,. ., . . + 2. ., . .}.
含铁
发表于 2025-3-31 07:26:41
http://reply.papertrans.cn/29/2812/281130/281130_56.png
咯咯笑
发表于 2025-3-31 12:00:02
http://reply.papertrans.cn/29/2812/281130/281130_57.png
Vulvodynia
发表于 2025-3-31 16:30:17
http://reply.papertrans.cn/29/2812/281130/281130_58.png
GUMP
发表于 2025-3-31 19:51:20
https://doi.org/10.1007/978-3-540-70666-3Graph; Graph theory; Sim; algorithm; algorithmic geometry; algorithms; combinatorial mathematics; computati
尖酸一点
发表于 2025-3-31 22:46:12
978-3-540-70665-6Springer-Verlag Berlin Heidelberg 2007