Multicore graphs: characterization and properties
From MaRDI portal
Publication:6616809
DOI10.1007/978-3-031-52969-6_10zbMath1548.0522MaRDI QIDQ6616809
Lilian Markenzon, Newton Paciornik
Publication date: 9 October 2024
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- New results on Ptolemaic graphs
- Core-satellite graphs: clustering, assortativity and spectral properties
- Strictly chordal graphs are leaf powers
- On the pathwidth of chordal graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- Algorithmic graph theory and perfect graphs
- On the corona of two graphs
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- A Characterization of Block-Graphs
- Graph Classes: A Survey
- Edge clique graphs and some classes of chordal graphs
- On clique corona graphs -- a short survey
This page was built for publication: Multicore graphs: characterization and properties