Complexity of the improper twin edge coloring of graphs

DOI10.1007/S00373-017-1782-7MaRDI QIDQ2409501zbMATH OpenOpenAlexFDO

Authors Paniz Abedin, Marc Demange, Tınaz Ekim, S. Akbari

Publication date 11 October 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-017-1782-7

zbMATH Keywords

NP-hardnessmodular chromatic indexodd/even color classestwin edge/vertex coloring

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On twin edge colorings of graphs
• scientific article; zbMATH DE number 7225175
• A twin edge coloring conjecture
• An upper bound for the twin chromatic index of a graph
• On twin edge coloring in trees

Cites work

• scientific article; zbMATH DE number 5942285 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256776 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Chromatic graph theory
• Color-induced graph colorings
• Domination on Cocomparability Graphs
• Edge weights and vertex colours
• Group irregularity strength of connected graphs
• Group sum chromatic number of graphs
• Neighbor sum distinguishing index
• On modular chromatic indexes of graphs
• On the neighbour-distinguishing index of a graph
• On twin edge colorings of graphs
• Vertex colouring edge partitions

This page was built for publication: Complexity of the improper twin edge coloring of graphs

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