Independent sets and chromatic numbers of circle graphs

DOI10.1007/s10958-014-2196-1zbMath1330.05116OpenAlexW2059817397MaRDI QIDQ906759

S. L. Berlov

Publication date: 29 January 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-2196-1

zbMATH Keywords

maximal independent sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• A characterization of circle graphs
• Covering and coloring polygon-circle graphs
• A triangle-free circle graph with chromatic number 5
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent sets and chromatic numbers of circle graphs