Efficient enumeration of non-isomorphic interval graphs

DOI10.46298/dmtcs.6164zbMath1462.05183arXiv1906.04094OpenAlexW2948403778MaRDI QIDQ4987268

Patryk Mikos

Publication date: 3 May 2021

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.04094

zbMATH Keywords

combinatoricsenumerationinterval graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs

This page was built for publication: Efficient enumeration of non-isomorphic interval graphs