On Injective Colourings of Chordal Graphs

DOI10.1007/978-3-540-78773-0_45MaRDI QIDQ5458556zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• On the complexity of injective colorings and its generalizations
• Injective colorings with arithmetic constraints
• On the injective chromatic number of graphs
• scientific article; zbMATH DE number 52166

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1256776 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Approximations for  -Colorings of Graphs
• Characterizations of strongly chordal graphs
• Coloring Powers of Chordal Graphs
• Decomposition by clique separators
• Labelling Graphs with a Condition at Distance 2
• List matrix partitions of chordal graphs
• On powers and centers of chordal graphs
• On powers of chordal graphs and their colorings
• On the injective chromatic number of graphs
• Partial covers of graphs
• Partitioning chordal graphs into independent sets and cliques
• Polarity of chordal graphs
• Zero knowledge and the chromatic number

Cited in

(25)

• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• Join colourings of chordal graphs
• Injective colouring for H-free graphs
• Acyclic, star, and injective colouring: bounding the diameter
• Injective colorings of wheel related graph families
• 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
• Injective colorings with arithmetic constraints
• Complexity and algorithms for injective edge coloring of graphs
• Injective edge coloring of some standard graph products
• scientific article; zbMATH DE number 7452301 (Why is no real title available?)
• Connectivity of minimum non-5-injectively colorable planar cubic graphs
• scientific article; zbMATH DE number 7651161 (Why is no real title available?)
• Injective coloring of subclasses of chordal graphs
• Partitions of graphs into cographs
• Injective coloring of generalized Mycielskian of graphs
• On the complexity of injective colorings and its generalizations
• Acyclic, star and injective colouring: a complexity picture for H-free 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)