scientific article; zbMATH DE number 7370927
From MaRDI portal
Publication:5000291
zbMath1468.05193MaRDI QIDQ5000291
Publication date: 12 July 2021
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p089.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- A Dirac-type characterization of \(k\)-chordal graphs
- Total chromatic number of unichord-free graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Subgraph trees in graph theory
- Determinantal formulae for matrix completions associated with chordal graphs
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Strong clique trees, neighborhood trees, and strongly chordal graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
This page was built for publication: