Complexity of the improper twin edge coloring of graphs

DOI10.1007/S00373-017-1782-7zbMATH Open1371.05067OpenAlexW2618969317MaRDI QIDQ2409501FDOQ2409501

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge weights and vertex colours
• Domination on Cocomparability Graphs
• Neighbor sum distinguishing index
• Title not available (Why is that?)
• Group sum chromatic number of graphs
• Vertex colouring edge partitions
• Chromatic graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the neighbour-distinguishing index of a graph
• Color-Induced Graph Colorings
• Group irregularity strength of connected graphs
• On twin edge colorings of graphs
• Title not available (Why is that?)

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)