Injective edge coloring of graphs

DOI10.2298/FIL1919411CzbMath1499.05206OpenAlexW3012156675WikidataQ114043024 ScholiaQ114043024MaRDI QIDQ5864435

J. P. Cruz, Charles Dominic, Jorge Orestes Cerdeira, Domingos Moreira Cardoso

Publication date: 7 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1919411c

zbMATH Keywords

injective coloringinjective edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Injective edge coloring of generalized Petersen graphs ⋮ Injective edge coloring of some sparse graphs ⋮ Injective edge coloring for graphs with small edge weight ⋮ Injective edge coloring of power graphs and necklaces ⋮ Injective edge-coloring of subcubic graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Injective chromatic index of sparse graphs ⋮ Injective edge coloring of graphs with maximum degree 5 ⋮ Unnamed Item ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ List injective edge-coloring of subcubic graphs ⋮ Note on injective edge-coloring of graphs ⋮ Injective edge-coloring of graphs with small weight ⋮ Injective edge chromatic index of generalized Petersen graphs ⋮ Injective edge coloring of sparse graphs with maximum degree 5

Cites Work

• Unnamed Item
• 3-consecutive edge coloring of a graph
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• Induced and weak induced arboricities
• Note on the perfect EIC-graphs
• On the injective chromatic number of graphs
• List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs
• The NP-Completeness of Edge-Coloring
• NP completeness of finding the chromatic index of regular graphs
• Injective coloring of planar graphs

This page was built for publication: Injective edge coloring of graphs