Some results on the injective chromatic number of graphs

DOI10.1007/s10878-011-9386-2zbMath1283.90044OpenAlexW2017143580WikidataQ114225863 ScholiaQ114225863MaRDI QIDQ1928520

Geňa Hahn, Min Chen, Andre Raspaud, Wei Fan Wang

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9386-2

zbMATH Keywords

planar graphmaximum degreeinjective coloring\(K_{4}\)-minor free graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

List injective coloring of planar graphs ⋮ Unnamed Item ⋮ Exact square coloring of subcubic planar graphs ⋮ List injective coloring of planar graphs with disjoint 5−-cycles ⋮ Connectivity of minimum non-5-injectively colorable planar cubic graphs ⋮ Injective coloring of planar graphs with girth 6 ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Packings in bipartite prisms and hypercubes ⋮ List injective coloring of planar graphs with girth 5, 6, 8 ⋮ Note on the perfect EIC-graphs ⋮ Coupon coloring of some special graphs ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ List injective coloring of planar graphs

Cites Work

• Unnamed Item
• Some bounds on the injective chromatic number of graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• On the injective chromatic number of graphs
• Topology of series-parallel networks
• On the \(L(p,1)\)-labelling of graphs
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• The $L(2,1)$-Labeling Problem on Graphs
• Injective coloring of planar graphs

This page was built for publication: Some results on the injective chromatic number of graphs