Lilian Markenzon

From MaRDI portal
Person:496682

Available identifiers

zbMath Open markenzon.lilianMaRDI QIDQ496682

List of research outcomes





PublicationDate of PublicationType
Multicore graphs: characterization and properties2024-10-09Paper
A new characterization of \(k\)-trees and some applications2024-06-10Paper
Strictly chordal graphs: structural properties and integer Laplacian eigenvalues2024-01-09Paper
Toughness and Hamiltonicity of strictly chordal graphs2023-11-27Paper
Exploring structural properties of $k$-trees and block graphs2023-01-25Paper
The scattering number of strictly chordal graphs: linear time determination2022-06-01Paper
https://portal.mardi4nfdi.de/entity/Q50376182022-03-03Paper
Integer Laplacian eigenvalues of chordal graphs2021-02-17Paper
On \((k+1)\)-line graphs of \(k\)-trees and their nullities2021-02-17Paper
Linear time determination of the scattering number for strictly chordal graphs2021-01-06Paper
Integer Laplacian eigenvalues of strictly chordal graphs2020-07-13Paper
Toughness and Hamiltonicity in Random Apollonian Networks2020-02-21Paper
Non-inclusion and other subclasses of chordal graphs2019-12-30Paper
Block-indifference graphs: characterization, structural and spectral properties2019-10-09Paper
https://portal.mardi4nfdi.de/entity/Q46109432019-01-23Paper
On the characteristic polynomial of the power of a path.2018-10-23Paper
Vulnerability of subclasses of chordal graphs2018-04-11Paper
https://portal.mardi4nfdi.de/entity/Q45908882017-11-20Paper
Counting and enumerating unlabeled split–indifference graphs2017-10-20Paper
On trees with maximum algebraic connectivity2017-07-19Paper
Strictly interval graphs: characterization and linear time recognition2016-10-18Paper
Solving problems for maximal reducible flowgraphs2016-07-01Paper
New results on Ptolemaic graphs2015-09-30Paper
Generating and counting unlabeled \(k\)-path graphs2015-09-22Paper
https://portal.mardi4nfdi.de/entity/Q29366632015-01-06Paper
An efficient representation of chordal graphs2014-05-14Paper
\(k\)-separator chordal graphs: leafage and subfamilies2013-11-14Paper
https://portal.mardi4nfdi.de/entity/Q30891992011-08-24Paper
One-phase algorithm for the determination of minimal vertex separators of chordal graphs2011-05-20Paper
https://portal.mardi4nfdi.de/entity/Q35819432010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q31848502009-10-22Paper
A clique-difference encoding scheme for labelled \(k\)-path graphs2009-03-04Paper
Two methods for the generation of chordal graphs2008-09-03Paper
The Reduced Prüfer Code for Rooted Labelled k-Trees2007-05-29Paper
Subclasses of \(k\)-trees: characterization and recognition2006-04-28Paper
Solving problems for maximal reducible flowgraphs.2004-03-14Paper
Equilateral drawing of 2-connected planar chordal graphs2001-09-23Paper
Maxregularity and maximal outerplanar graphs2001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q49498032001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q49498492001-05-17Paper

Research outcomes over time

This page was built for person: Lilian Markenzon