scientific article; zbMATH DE number 7788348

DOI10.5555/3458064.3458074MaRDI QIDQ6147256zbMATH OpenFDO

Authors Rémi de Joannis de Verclos, Ross J. Kang

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2007.07874

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• Strongly proper connected coloring of graphs
• A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
• On semistrong edge-colorings of outerplanar graphs
• List strong and list normal edge-coloring of (sub)cubic graphs
• Random independent sets in triangle-free graphs
• On strong chromatic index of some operations on graphs
• Eigenvalue bounds for distance-edge colourings
• Semistrong edge coloring and (0,1)-relaxed strong edge coloring of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147256)