Research demonstrating that planar graphs without 4-cycles adjacent to triangles are DP-4-colourable has provided a valuable extension of previous list colouring results, thereby establishing ...

Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science.

Journal of Computer and System Sciences (2021). [3] An embedding-based distance for temporal graphs. Nature Communications (2024). Back to "Graph, Social and Multimedia Data" ...

European Journal of Combinatorics (2005). [2] Pentavalent symmetric graphs admitting vertex-transitive non-abelian simple groups. European Journal of Combinatorics (2017).

[3] On perfect codes in Cartesian products of graphs. European Journal of Combinatorics (2011). [4] Kernels and p-Kernels of pr-ary 1-Perfect Codes. Designs, Codes and Cryptography (2005).

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into ...

Journal of Algebra (2013). [4] Groups with the Same Non-Commuting Graph. Discrete Applied Mathematics (2009). Back to "Group Theory and Generalisations" ...