Injective coloring of subclasses of chordal graphs
From MaRDI portal
Publication:6652425
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
Cites work
- A unified approach to domination problems on interval graphs
- Algorithmic graph theory and perfect graphs
- Injective coloring of graphs revisited
- Injective coloring of some graph operations
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
- Injective colorings of graphs with low average degree
- Injective colorings of planar graphs with few colors
- Injective colorings of sparse graphs
- On Injective Colourings of Chordal Graphs
- On the complexity of injective colorings and its generalizations
- On the injective chromatic number of graphs
- Reducibility among combinatorial problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The \(k\)-edge intersection graphs of paths in a tree
- The fractional chromatic number of mycielski's graphs
- Zero knowledge and the chromatic number
This page was built for publication: Injective coloring of subclasses of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652425)
