Titlebook: Combinatorial Algorithms; 30th International W Charles J. Colbourn,Roberto Grossi,Nadia Pisanti Conference proceedings 2019 Springer Nature

hardheaded

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs,exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for . in proper interval graphs.

飛鏢

Cosmopolitan

高射炮

終止

Substitution

overbearing

FADE

The Hull Number in the Convexity of Induced Paths of Order 3,ning .. If the .-convex hull of . is .(.), then . is a .. The minimum size of a .-hull set is the .. In this paper, we show that the problem of deciding whether the .-hull number of a chordal graph is at most . is .-complete and present a linear-time algorithm to determine this parameter and provide

沙草紙

Supermagic Graphs with Many Odd Degrees, is equal to the same number ., called the ...Recently, Ková? et al. affirmatively answered a question by Madaras about existence of supermagic graphs with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic

心神不寧

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229881.jpg