Colinear Coloring on Graphs

DOI10.1007/978-3-642-00202-1_11zbMath1211.05041OpenAlexW1792036429MaRDI QIDQ3605491

Kyriaki Ioannidou, Stavros D. Nikolopoulos

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_11

zbMATH Keywords

complexityalgorithmschromatic numberchordal graphsthreshold graphsquasi-threshold graphscolinear coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Recognizing cographs and threshold graphs through a classification of their edges
• Kneser's conjecture, chromatic number, and homotopy
• Generalized Kneser coloring theorems with combinatorial proofs
• Box complexes, neighborhood complexes, and the chromatic number
• Linear colorings of simplicial complexes and collapsing
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Graph Classes: A Survey
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Colinear Coloring on Graphs