Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...
SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...
Taiwanese Journal of Mathematics, Vol. 22, No. 1 (February 2018), pp. 1-15 (15 pages) A. A. Abueida and M. Daven, Multidesigns for graph-pairs of order 4 and 5 ...
Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework, ...
We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...
P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback