Titlebook: ;

只看該作者 · 發(fā)表于 2025-4-1 04:12:07

Domination Search on Graphs with Low Dominating-Target-NumberWe settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.

只看該作者 · 發(fā)表于 2025-4-1 08:52:51

Channel Assignment and Improper Choosability of GraphsWe model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.

只看該作者 · 發(fā)表于 2025-4-1 13:21:55

Graph-Theoretic Concepts in Computer Science978-3-540-31468-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

只看該作者 · 發(fā)表于 2025-4-1 14:48:07

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 04:53
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved