Enumerating and Generating Labeled k-degenerate Graphs

DOI10.1137/1.9781611973006.12zbMath1429.05099OpenAlexW2404397120MaRDI QIDQ5194683

Dorothea Wagner, Reinhard Bauer, Marcus Krug

Publication date: 16 September 2019

Published in: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973006.12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph ⋮ Unnamed Item

This page was built for publication: Enumerating and Generating Labeled k-degenerate Graphs