Non-inclusion and other subclasses of chordal graphs

DOI10.1016/j.dam.2018.05.058zbMath1429.05196OpenAlexW2807840498MaRDI QIDQ2283105

Lilian Markenzon

Publication date: 30 December 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.058

zbMATH Keywords

chordal graphsminimal vertex separatorclique-bipartite graphgraph subclassnon-inclusion chordal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph theory (05C99)

Related Items (2)

The scattering number of strictly chordal graphs: linear time determination ⋮ Strictly chordal graphs: structural properties and integer Laplacian eigenvalues

Cites Work

• On basic chordal graphs and some of its subclasses
• Reduced clique graphs of chordal graphs
• New results on Ptolemaic graphs
• Into the square: on the complexity of some quadratic-time solvable problems
• Strictly chordal graphs are leaf powers
• Characterising \((k,\ell )\)-leaf powers
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
• Simplicial powers of graphs
• Clique tree generalization and new subclasses of chordal graphs
• Block duplicate graphs and a hierarchy of chordal graphs
• Subclasses of \(k\)-trees: characterization and recognition
• Rebuilding convex sets in graphs
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Graph Classes: A Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-inclusion and other subclasses of chordal graphs