Injective coloring of subclasses of chordal graphs
DOI10.1016/J.TCS.2024.114894MaRDI QIDQ6652425FDOQ6652425
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
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)
Cites Work
- Reducibility among Combinatorial Problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Algorithmic graph theory and perfect graphs
- The \(k\)-edge intersection graphs of paths in a tree
- Zero knowledge and the chromatic number
- Injective colorings of planar graphs with few colors
- A unified approach to domination problems on interval graphs
- The fractional chromatic number of mycielski's graphs
- On the injective chromatic number of graphs
- On the complexity of injective colorings and its generalizations
- On Injective Colourings of Chordal Graphs
- Injective colorings of graphs with low average degree
- Injective colorings of sparse graphs
- Injective coloring of graphs revisited
- Injective coloring of some graph operations
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
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)
