Colinear Coloring on Graphs

DOI10.1007/978-3-642-00202-1_11MaRDI QIDQ3605491zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmscomplexitychromatic numberchordal graphsthreshold graphsquasi-threshold graphscolinear coloring

Mathematics Subject Classification ID

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

Recommendations

• Linear coloring of graphs
• Harmonious coloring on subclasses of colinear graphs
• Linear colorings of simplicial complexes and collapsing
• The topology of the coloring complex
• The linear \(t\)-colorings of Sierpiński-like graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Box complexes, neighborhood complexes, and the chromatic number
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Generalized Kneser coloring theorems with combinatorial proofs
• Graph Classes: A Survey
• Kneser's conjecture, chromatic number, and homotopy
• Linear colorings of simplicial complexes and collapsing
• Recognizing cographs and threshold graphs through a classification of their edges

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)