Graphs that have separator tree representations

MaRDI QIDQ5000291zbMATH OpenFDO

Authors Terry A. McKee

Publication date 12 July 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p089.pdf

zbMATH Keywords

chordal graphstrong separator trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Recommendations

• Graphs with complete minimal k-vertex separators.
• The clique-separator graph for chordal graphs
• Independent separator graphs
• scientific article; zbMATH DE number 17505
• k-separator chordal graphs: leafage and subfamilies

Cites work

• scientific article; zbMATH DE number 17505 (Why is no real title available?)
• A Dirac-type characterization of \(k\)-chordal graphs
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• Counting clique trees and computing perfect elimination schemes in parallel
• Determinantal formulae for matrix completions associated with chordal graphs
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Graph Classes: A Survey
• Independent separator graphs
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Subgraph trees in graph theory
• Topics in Intersection Graph Theory
• Total chromatic number of unichord-free graphs

This page was built for publication: Graphs that have separator tree representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000291)