Titlebook: ;

ASSAY

刺穿

My Favorite Domination Conjectures in Graph Theory Are Bounded,For a graph . of order . and a parameter ?(.), if ?(.) ≤ .. for some rational number ., where 0 < . < 1, then we refer to this upper bound on ?(.) as an .-bound on ?(.). In this chapter, we present over twenty .-bound conjectures on domination type parameters.

Infinitesimal

Graph Theory978-3-319-31940-7Series ISSN 0941-3502 Series E-ISSN 2197-8506

過多

Circuit Double Covers of Graphs,hree major snark family conjectures since they are all trivial for 3-edge-colorable cubic graphs and remain widely open for snarks. This chapter is a brief survey of the progress on this famous open problem.

滔滔不絕的人

https://doi.org/10.1007/978-1-349-07326-9 a union of two triangle-free graphs. Although several problems discussed in this paper are concerned with concrete cases and some involve significant computational approaches, there are interesting and important theoretical questions behind each of them.

碎石頭

limber

https://doi.org/10.1007/978-3-7091-9795-0rees, subgraphs in decompositions all of which are non-isomorphic and subgraphs in an edge-colored graph, all of whose edges are colored differently. It is concepts such as these that are discussed in this chapter, together with related conjectures and open questions.

伙伴

螢火蟲

Hemiparesis