Strong triadic closure in cographs and graphs of low maximum degree

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

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

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

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Parameterized aspects of strong subgraph closure ⋮ Strong triadic closure in cographs and graphs of low maximum degree ⋮ Unnamed Item

This page was built for publication: Strong triadic closure in cographs and graphs of low maximum degree