Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.

The study of geodetic numbers in graph theory represents a compelling fusion of abstract mathematical ideas with practical applications across network analysis, computational optimisation, and ...

An introduction to topics in discrete mathematics, including set theory, logic, equivalence relations, mathematical induction, combinatorics, graphs, trees, algorithm ...

Discrete Mathematics (2023). [3] Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. Discrete Applied Mathematics (2023).

Discrete Mathematics 323. (2014): 81-83. Print. * Wenger, Paul S. "Fractional Acquisition in Graphs." Discrete Applied Mathematics 178. (2014): 142-148. Print. * Published Conference Proceedings ...

L. Stacho, A sufficient condition guaranteeing large cycles in graphs, Discrete Mathematics 169 (1997), 273-277. L. Stacho, A new Chvatal type condition for pancyclicity, Graphs and Combinatorics 13 ...

Finally, by adding some edges to the graph G∗, we obtain the crossing numbers of the join products of other four graphs with Dn. The Carpathian Journal of Mathematics publishes high quality original ...