Note on the perfect EIC-graphs

DOI10.1016/j.amc.2016.05.031zbMath1410.05076OpenAlexW2417635241MaRDI QIDQ1733665

Xia Zhang, Jun Yue, Shiliang Zhang

Publication date: 21 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2016.05.031

zbMATH Keywords

edge coloringinjective coloringinjective edge chromatic indexinjective edge coloringperfect EIC-graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items

Injective edge coloring of generalized Petersen graphs ⋮ Injective edge coloring of some sparse graphs ⋮ Injective edge coloring for graphs with small edge weight ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Unnamed Item ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Note on the perfect Roman domination number of graphs ⋮ On the double Roman domination of graphs ⋮ Injective edge coloring of graphs ⋮ Injective edge chromatic index of generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• Injective colorings of graphs with low average degree
• Some bounds on the injective chromatic number of graphs
• Injective colorings of planar graphs with few colors
• On the injective chromatic number of graphs
• Some results on the injective chromatic number of graphs
• Rainbow connections of graphs: a survey
• INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
• Injective coloring of planar graphs

This page was built for publication: Note on the perfect EIC-graphs