Injective edge coloring of graphs

DOI10.2298/FIL1919411CMaRDI QIDQ5864435zbMATH OpenOpenAlexWikidataFDO

Authors Charles Dominic, J. P. Cruz, D. M. Cardoso, Jorge Orestes Cerdeira

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)

Cites work

• 3-consecutive edge coloring of a graph
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Induced and weak induced arboricities
• Injective coloring of planar graphs
• List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs
• Note on the perfect EIC-graphs
• NP completeness of finding the chromatic index of regular graphs
• On the injective chromatic number of graphs
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• The NP-Completeness of Edge-Coloring

Cited in

(37)

• 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
• Injective edge coloring of generalized Petersen graphs
• Injective edge coloring for graphs with small edge weight
• scientific article; zbMATH DE number 7318748 (Why is no real title available?)
• Injective coloring of complementary prism and generalized complementary prism graphs
• Injective edge coloring of some sparse graphs
• 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
• The injective chromatic index of a claw-free subcubic graph is at most 6
• Injective edge chromatic index of generalized Petersen graph \(P(ck,k)\)
• Injective chromatic index of K₄-minor free graphs
• Injective edge chromatic number of sparse graphs
• Injective edge coloring of some standard graph products
• Injective-edge-coloring of planar graphs with girth restriction
• Injective edge-coloring of claw-free subcubic graphs
• Edge open packing: complexity, algorithmic aspects, and bounds
• On injective edge-coloring of graphs with maximum degree 4
• Injective edge-colorings of K₄-minor free graphs
• On injective edge coloring for a class of graphs with maximum degree 5
• On injective edge coloring of sparse graphs with maximum degree 5
• Injective edge coloring of sparse graphs
• Injective edge colorings of degenerate graphs and the oriented chromatic number
• Further results on injective edge coloring of graphs with maximum degree 5
• Injective edge chromatic index of sparse graphs
• Induced matching vs edge open packing: trees and product graphs
• On injective chromatic index of sparse graphs with maximum degree 5
• The injective chromatic index of planar graphs with maximum degree 4
• Some bounds on the injective edge chromatic number

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

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