Titlebook: ;

MIRE

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.

伪善

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.

一再遛

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

平项山