A connectivity-based decomposition for graph edge-colouring

DOI10.21711/231766362020/RMC4616MaRDI QIDQ6492333zbMATH OpenFDO

Authors Leandro M. Zatesko, João Pedro W. Bernardi, Sheila M. de Almeida, Renato Carmo, André L. P. Guedes

Publication date 25 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362020/RMC4616

zbMATH Keywords

graph algorithmschordal graphsgraph connectivitydecomposition algorithmsgraph edge-colouring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Decompositions for the edge colouring of reduced indifference graphs.
• Edge-colouring and total-colouring chordless graphs
• Decompositions for edge-coloring join graphs and cobipartite graphs
• scientific article; zbMATH DE number 1156685

This page was built for publication: A connectivity-based decomposition for graph edge-colouring

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