Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph

DOI10.1007/978-3-319-62389-4_13zbMath1436.05046OpenAlexW2728920311MaRDI QIDQ2412406

Mamadou Moustapha Kanté, Takeaki Uno, Alessio Conte, Yota Otachi, Kunihiro Wasa

Publication date: 23 October 2017

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

zbMATH Keywords

maximal independent sets\(n\)-vertex chordal graphmaximal induced forests

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Unnamed Item