Validity of the weakened Hadwiger hypothesis
Page 1
Displaying 1 – 6 of 6
Validity up to complementation in graph theory
T. McKee (1983)
Fundamenta Mathematicae
Vermutungen über numerierbare Graphen.
Hj. Stocker (1986)
Elemente der Mathematik
Vertex deletion games with parity rules.
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Vertex-strength of fuzzy graphs.
Eslahchi, Changiz, Onagh, B.N. (2006)
International Journal of Mathematics and Mathematical Sciences
Vizing's conjecture and the one-half argument
Bert Hartnell, Douglas F. Rall (1995)
Discussiones Mathematicae Graph Theory
The domination number of a graph G is the smallest order, γ(G), of a dominating set for G. A conjecture of V. G. Vizing [5] states that for every pair of graphs G and H, γ(G☐H) ≥ γ(G)γ(H), where G☐H denotes the Cartesian product of G and H. We show that if the vertex set of G can be partitioned in a certain way then the above inequality holds for every graph H. The class of graphs G which have this type of partitioning includes those whose 2-packing number is no smaller than γ(G)-1 as well as the...
Currently displaying 1 – 6 of 6
Page 1