Strong triadic closure in cographs and graphs of low maximum degree

DOI10.1007/978-3-319-62389-4_29zbMath1434.68363MaRDI QIDQ5920156

Charis Papadopoulos, Stavros D. Nikolopoulos, Athanasios L. Konstantinidis

Publication date: 23 October 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_29

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)