Colinear Coloring on Graphs
type: Item
instance of: scholarly article
title: Colinear Coloring on Graphs
zbMATH Open document ID: 1211.05041
DOI: 10.1007/978-3-642-00202-1_11
author: Kyriaki Ioannidou
author: Stavros D. Nikolopoulos
published in: WALCOM: Algorithms and Computation
publication date: 2009-02-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5510255
zbMATH Keywords: colinear coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: chordal graphs
zbMATH Keywords: threshold graphs
zbMATH Keywords: quasi-threshold graphs
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-00202-1 11
OpenAlex ID: W1792036429
cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
cites work: Graph Classes: A Survey
cites work: Linear colorings of simplicial complexes and collapsing
cites work: Box complexes, neighborhood complexes, and the chromatic number
cites work: Q3328583
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Kneser's conjecture, chromatic number, and homotopy
cites work: Recognizing cographs and threshold graphs through a classification of their edges
cites work: Generalized Kneser coloring theorems with combinatorial proofs
description: scientific article