Graphs with coloring redundant edges

DOI10.5614/EJGTA.2016.4.2.9MaRDI QIDQ5006591zbMATH OpenOpenAlexFDO

Authors Bart Demoen, Phuong-Lan Nguyen

Publication date 16 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2016.4.2.9

zbMATH Keywords

coloring of graphs and hypergraphsextremal problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Edge irredundant colorings in graphs
• Maximal edge-colorings of graphs
• Well irredundant graphs
• k-resistant colorings
• Irredundant colorings of graphs

Cites work

• Graph theory
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Redundant disequalities in the Latin square problem
• Redundant Sudoku rules
• Sur le coloriage des graphs
• Uniquely colorable graphs

Cited in

(2)

• Edge irredundant colorings in graphs
• The rainbow k-connectivity of the non-commutative graph of a finite group

This page was built for publication: Graphs with coloring redundant edges

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