Colinear Coloring on Graphs
From MaRDI portal
Publication:3605491
DOI10.1007/978-3-642-00202-1_11zbMATH Open1211.05041OpenAlexW1792036429MaRDI QIDQ3605491FDOQ3605491
Authors: 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
Recommendations
algorithmscomplexitychromatic numberchordal graphsthreshold graphsquasi-threshold graphscolinear coloring
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Kneser's conjecture, chromatic number, and homotopy
- Recognizing cographs and threshold graphs through a classification of their edges
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- Generalized Kneser coloring theorems with combinatorial proofs
- Linear colorings of simplicial complexes and collapsing
- Box complexes, neighborhood complexes, and the chromatic number
This page was built for publication: Colinear Coloring on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605491)