Titlebook: ;

衰弱的心

Circuit Double Covers of Graphs,raph theorists as one of the major open problems in the field. The CDC conjecture, Tutte’s 5-flow conjecture, and the Berge-Fulkerson conjecture are three 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

Nostalgia

剧毒

DOSE

反省

不愿

大猩猩

https://doi.org/10.1007/978-1-349-12564-7 The most studied property is that of inducing an empty graph–a graph without any edges. Changing the property slightly creates interesting variations. In this paper I will discuss a few of my favorite coloring problems and variations. This discussion is not meant to be comprehensive. The field is s

斜

https://doi.org/10.1007/978-1-349-13431-1g (1) the 1963 Vizing’s Conjecture about the domination number of the Cartesian product of two graphs [47], (2) the 1966 Hedetniemi Conjecture about the chromatic number of the categorical product of two graphs [28], (3) the 1976 Tree Packing Conjecture of Gyárfás and Lehel [23], (4) the 1981 Path P

Little

https://doi.org/10.1007/978-3-642-34249-3 A closer inspection reveals an interesting common feature. Trees and hypercubes can be constructed using a similar sort of expansion procedure. Now, we can introduce a class of graphs that forms a common generalization of trees and hypercubes: it consists of all those graphs that can be constructed

Obsequious