Pages that link to "Item:Q5458556"
From MaRDI portal
The following pages link to On Injective Colourings of Chordal Graphs (Q5458556):
Displaying 22 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- On the injective chromatic number of graphs (Q1849923) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- On injective chromatic polynomials of graphs (Q3451075) (← links)
- (Q5020302) (← links)
- (Q5874489) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Complexity and algorithms for injective edge coloring of graphs (Q6132966) (← links)
- Injective edge coloring of some standard graph products (Q6637040) (← links)
- Injective coloring of subclasses of chordal graphs (Q6652425) (← links)
