Some results on the injective chromatic number of graphs
From MaRDI portal
Publication:1928520
Recommendations
Cites work
- A Theorem about the Channel Assignment Problem
- Coloring the square of a \(K_{4}\)-minor free graph
- scientific article; zbMATH DE number 5764899 (Why is no real title available?)
- Injective coloring of planar graphs
- Labelling Graphs with a Condition at Distance 2
- On the \(L(p,1)\)-labelling of graphs
- On the injective chromatic number of graphs
- Some bounds on the injective chromatic number of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Topology of series-parallel networks
Cited in
(28)- Almost injective colorings
- Note on the perfect EIC-graphs
- On the injective chromatic number of graphs
- Injective choosability of subcubic planar graphs with girth 6
- Injective coloring of Halin graphs
- Injective edge chromatic index of generalized Petersen graphs
- List injective coloring of planar graphs
- Connectivity of minimum non-5-injectively colorable planar cubic graphs
- Critical injective chromatic graphs
- Two smaller upper bounds of List injective chromatic number
- List injective coloring of planar graphs with girth 5, 6, 8
- Exact square coloring of subcubic planar graphs
- On injective chromatic polynomials of graphs
- Injective coloring of planar graphs with girth 6
- scientific article; zbMATH DE number 7318748 (Why is no real title available?)
- scientific article; zbMATH DE number 7452301 (Why is no real title available?)
- List injective coloring of planar graphs with disjoint 5^--cycles
- Coupon coloring of some special graphs
- Vertex partitions of \(K_{4,4}\)-minor free graphs
- List injective coloring of planar graphs
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
- Packings in bipartite prisms and hypercubes
- On domatic number of graphs
- Injective chromatic index of K₄-minor free graphs
- Injective edge-coloring of claw-free subcubic graphs
- Injective (+2)-coloring of planar graphs with girth 5
- List injective ( + 4)-coloring of planar graphs
- Some bounds on the injective chromatic number of graphs
This page was built for publication: Some results on the injective chromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928520)