On the injective chromatic number of graphs
From MaRDI portal
Publication:1849923
DOI10.1016/S0012-365X(01)00466-6zbMath1007.05046OpenAlexW2125862453WikidataQ114122944 ScholiaQ114122944MaRDI QIDQ1849923
Geňa Hahn, Jan Kratochvíl, Jozef Širáň, Dominique Sotteau
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00466-6
hypercubeprojective planeregular grapherror-correcting codeNP-complete probleminjective coloringinjective chromatic number
Related Items
Injective edge coloring of generalized Petersen graphs ⋮ On coupon coloring of Cartesian product of some graphs ⋮ INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7 ⋮ Almost injective colorings ⋮ On injective chromatic polynomials of graphs ⋮ Injective coloring of planar graphs with girth 5 ⋮ List injective coloring of a class of planar graphs without short cycles ⋮ The complexity of \(L(p, q)\)-edge-labelling ⋮ List injective coloring of planar graphs ⋮ Unnamed Item ⋮ Injective coloring of some graph operations ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ An injective version of the 1-2-3 conjecture ⋮ Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree ⋮ Injective coloring of some subclasses of bipartite graphs and chordal graphs ⋮ 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 ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ On the complexity of injective colorings and its generalizations ⋮ Injective coloring of planar graphs with girth 6 ⋮ Graph equation for line graphs and \(m\)-step graphs ⋮ Some results on the injective chromatic number of graphs ⋮ Injective coloring of plane graphs with girth 5 ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List injective colorings of planar graphs ⋮ LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Injectively \(k\)-colored rooted forests ⋮ Injective choosability of planar graphs of girth five and six ⋮ Injective edge-coloring of subcubic graphs ⋮ Injective colorings with arithmetic constraints ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ On tension-continuous mappings ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ Unnamed Item ⋮ Injective coloring of graphs revisited ⋮ Packings in bipartite prisms and hypercubes ⋮ Tension continuous maps -- their structure and applications ⋮ Frugal, acyclic and star colourings of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ List injective coloring of planar graphs with girth 5, 6, 8 ⋮ Iterated open neighborhood graphs and generalizations ⋮ Unnamed Item ⋮ Injective chromatic number of outerplanar graphs ⋮ Unnamed Item ⋮ Note on the perfect EIC-graphs ⋮ Injective edge coloring of sparse graphs ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ On the complexity of generalized chromatic polynomials ⋮ The \(k\)-independence number of \(t\)-connected graphs ⋮ Coupon coloring of some special graphs ⋮ LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5 ⋮ Injective coloring of planar graphs ⋮ Some bounds on the injective chromatic number of graphs ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ Injective colorings of graphs with low average degree ⋮ Unnamed Item ⋮ Injective coloring of planar graphs ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ List injective coloring of planar graphs ⋮ The complexity of locally injective homomorphisms ⋮ Injective colorings of sparse graphs ⋮ The complexity of \(L(p, q)\)-edge-labelling ⋮ The complexity of frugal colouring ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Obstructions to locally injective oriented improper colourings ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Injective coloring of Halin graphs ⋮ On Injective Colourings of Chordal Graphs ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Injective coloring of complementary prism and generalized complementary prism graphs ⋮ Further results on the rainbow vertex-disconnection of graphs ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs ⋮ On the \(k\)-independence number of graphs ⋮ Unnamed Item ⋮ Injective colorings of planar graphs with few colors ⋮ Injective edge coloring of graphs ⋮ On coupon colorings of graphs ⋮ Injective colouring for H-free graphs
