Injective colorings of sparse graphs

From MaRDI portal
Publication:710598

DOI10.1016/j.disc.2010.07.003zbMath1209.05075arXiv1007.0786OpenAlexW2057330543WikidataQ114190774 ScholiaQ114190774MaRDI QIDQ710598

Seog-Jin Kim, Daniel W. Cranston, Gexin Yu

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0786




Related Items

INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7On injective chromatic polynomials of graphsInjective coloring of planar graphs with girth 5List injective coloring of planar graphsUnnamed ItemInjective coloring of some graph operationsInjective coloring of some subclasses of bipartite graphs and chordal graphsConnectivity of minimum non-5-injectively colorable planar cubic graphs2-distance coloring of planar graphs with girth 5Graph equation for line graphs and \(m\)-step graphsInjective coloring of plane graphs with girth 5List injective colorings of planar graphs2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4Injective \(\Delta +2\) coloring of planar graph without short cyclesInjective choosability of planar graphs of girth five and sixInjective coloring of graphs revisitedA note on odd colorings of 1-planar graphsList injective coloring of planar graphs with girth 5, 6, 8Unnamed ItemAn introduction to the discharging method via graph coloringCoupon coloring of some special graphsLIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5Two smaller upper bounds of List injective chromatic numberInjective \((\Delta + 1)\)-coloring of planar graphs with girth 6Injective colorings of graphs with low average degreeInjective choosability of subcubic planar graphs with girth 6List injective coloring of planar graphs with girth \(g \geq 6\)Nordhaus-Gaddum-type relations of three graph coloring parametersRemarks on proper conflict-free colorings of graphsOn coupon colorings of graphs



Cites Work


This page was built for publication: Injective colorings of sparse graphs