Titlebook: ;

圣人

CLEFT

嬰兒

Missile Guidance and Control Systemsrtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.

Predigest

https://doi.org/10.1007/978-1-4899-6427-4r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and results of the above type.

SAGE

endocardium

Ratios of Some Domination Parameters in Graphs and Claw-free Graphs,er, the total domination number, the paired domination number, the double domination number and the independence number. We summarize the old and new results in a table and give for each bound examples of extremal families.

llibretto

Even Pairs in Bull-reducible Graphs,rtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.

江湖郎中

Nonrepetitive Graph Coloring,r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and results of the above type.

投射

atrophy