The paper, "Every subcubic multigraph is (1,27)-packing edge-colorable," is published in The Journal of Graph Theory. An example of coloring: A minimum of two colors is needed for the four dots if ...

Total colouring addresses the problem of assigning colours simultaneously to the vertices and edges of a graph so that no two adjacent or incident elements share the same colour. Introduced in the ...

The vertex cover problem seeks a minimum-cardinality set of vertices in a graph such that every edge is incident to at least one selected vertex. As an NP-hard combinatorial optimisation challenge, it ...