On Injective Colourings of Chordal Graphs
DOI10.1007/978-3-540-78773-0_45zbMATH Open1136.68463OpenAlexW1929096065MaRDI QIDQ5458556FDOQ5458556
Authors: Juraj Stacho, Pavol Hell, André Raspaud 
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_45
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Decomposition by clique separators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labelling Graphs with a Condition at Distance 2
- Characterizations of strongly chordal graphs
- Partitioning chordal graphs into independent sets and cliques
- Approximations for -Colorings of Graphs
- Zero knowledge and the chromatic number
- On powers of chordal graphs and their colorings
- Title not available (Why is that?)
- List matrix partitions of chordal graphs
- On the injective chromatic number of graphs
- Partial covers of graphs
- Polarity of chordal graphs
- On powers and centers of chordal graphs
- Coloring Powers of Chordal Graphs
Cited In (22)
- Join colourings of chordal graphs
- Injective colouring for H-free graphs
- Acyclic, star, and injective colouring: bounding the diameter
- On the injective chromatic number of graphs
- On the algorithmic aspects of strong subcoloring
- Acyclic, star, and injective colouring: bounding the diameter
- The complexity of frugal colouring
- On injective chromatic polynomials of graphs
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- Polarity of chordal graphs
- Solving partition problems with colour-bipartitions
- Injective coloring of some graph operations
- Complexity and algorithms for injective edge coloring of graphs
- Injective colorings with arithmetic constraints
- Injective edge coloring of some standard graph products
- Title not available (Why is that?)
- Connectivity of minimum non-5-injectively colorable planar cubic graphs
- Title not available (Why is that?)
- Injective coloring of subclasses of chordal graphs
- Partitions of graphs into cographs
- On the complexity of injective colorings and its generalizations
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
This page was built for publication: On Injective Colourings of Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458556)
