Pages that link to "Item:Q1849923"
From MaRDI portal
The following pages link to On the injective chromatic number of graphs (Q1849923):
Displaying 50 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Injective coloring of planar graphs with girth 6 (Q389479) (← links)
- Injective coloring of plane graphs with girth 5 (Q393179) (← links)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Injective choosability of planar graphs of girth five and six (Q409477) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- Coupon coloring of some special graphs (Q512874) (← links)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
- On coupon coloring of Cartesian product of some graphs (Q831735) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Some bounds on the injective chromatic number of graphs (Q960972) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- Almost injective colorings (Q1630939) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- Injective chromatic number of outerplanar graphs (Q1722035) (← links)
- Note on the perfect EIC-graphs (Q1733665) (← links)
- Graph equation for line graphs and \(m\)-step graphs (Q1928288) (← links)
- Some results on the injective chromatic number of graphs (Q1928520) (← links)
- Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- Injective coloring of Halin graphs (Q2039704) (← links)
- Further results on the rainbow vertex-disconnection of graphs (Q2049030) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- Injective edge coloring of generalized Petersen graphs (Q2130827) (← links)
- Injective coloring of planar graphs with girth 5 (Q2141334) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- List injective coloring of planar graphs (Q2155650) (← links)
- Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
- Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- The \(k\)-independence number of \(t\)-connected graphs (Q2244182) (← links)
- Two smaller upper bounds of List injective chromatic number (Q2253957) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- On tension-continuous mappings (Q2427549) (← links)
- List injective coloring of planar graphs with girth 5, 6, 8 (Q2446315) (← links)
- Iterated open neighborhood graphs and generalizations (Q2446342) (← links)
