Graphs that have separator tree representations

zbMATH Open1468.05193MaRDI QIDQ5000291FDOQ5000291

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

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

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)

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• A Dirac-type characterization of \(k\)-chordal graphs
• Total chromatic number of unichord-free graphs
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• 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
• Title not available (Why is that?)
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Determinantal formulae for matrix completions associated with chordal graphs
• Independent separator graphs
• Subgraph trees in graph theory

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)