List injective colorings of planar graphs
From MaRDI portal
Publication:615993
DOI10.1016/J.DISC.2010.10.008zbMATH Open1216.05027OpenAlexW2032395556WikidataQ114190771 ScholiaQ114190771MaRDI QIDQ615993FDOQ615993
Oleg V. Borodin, Anna O. Ivanova
Publication date: 7 January 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.10.008
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- List edge and list total colourings of multigraphs
- On the total coloring of planar graphs.
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- The structure of the planar triangulations in terms of bundles and stars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Injective colorings of planar graphs with few colors
- Edge-partitions of planar graphs and their game coloring numbers
- On the injective chromatic number of graphs
- Injective coloring of planar graphs
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Injective colorings of sparse graphs
- Coloring Powers of Planar Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (26)
- List injective coloring of planar graphs with girth \(g \geq 6\)
- Weight of edges in normal plane maps
- Light 3-stars in sparse plane graphs
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
- The complexity of frugal colouring
- LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5
- List injective coloring of planar graphs with girth 5, 6, 8
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weight of 3-paths in sparse plane graphs
- Nordhaus-Gaddum-type relations of three graph coloring parameters
- Injective coloring of Halin graphs
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- Injective coloring of planar graphs
- INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
- Two smaller upper bounds of List injective chromatic number
- Title not available (Why is that?)
- 2-distance coloring of planar graphs with girth 5
- Connectivity of minimum non-5-injectively colorable planar cubic graphs
- An optimal square coloring of planar graphs
- List injective coloring of planar graphs with disjoint 5−-cycles
- Refined weight of edges in normal plane maps
- List injective coloring of planar graphs
- List injective coloring of planar graphs
- List injective coloring of a class of planar graphs without short cycles
- Injective choosability of planar graphs of girth five and six
This page was built for publication: List injective colorings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615993)