Lilian Markenzon

From MaRDI portal
(Redirected from Person:496682)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Multicore graphs: characterization and properties2024-10-09Paper
A new characterization of \(k\)-trees and some applications
Computational and Applied Mathematics
2024-06-10Paper
Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
Linear Algebra and its Applications
2024-01-09Paper
Toughness and Hamiltonicity of strictly chordal graphs
International Transactions in Operational Research
2023-11-27Paper
Exploring structural properties of $k$-trees and block graphs2023-01-25Paper
The scattering number of strictly chordal graphs: linear time determination
Graphs and Combinatorics
2022-06-01Paper
scientific article; zbMATH DE number 7483773 (Why is no real title available?)2022-03-03Paper
Integer Laplacian eigenvalues of chordal graphs
Linear Algebra and its Applications
2021-02-17Paper
On \((k+1)\)-line graphs of \(k\)-trees and their nullities
Linear Algebra and its Applications
2021-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 graphs
Discrete Applied Mathematics
2019-12-30Paper
Block-indifference graphs: characterization, structural and spectral properties
Discrete Applied Mathematics
2019-10-09Paper
scientific article; zbMATH DE number 7005614 (Why is no real title available?)2019-01-23Paper
On the characteristic polynomial of the power of a path
Proyecciones (Antofagasta)
2018-10-23Paper
Vulnerability of subclasses of chordal graphs2018-04-11Paper
scientific article; zbMATH DE number 6810347 (Why is no real title available?)2017-11-20Paper
Counting and enumerating unlabeled split-indifference graphs
Discrete Mathematics, Algorithms and Applications
2017-10-20Paper
On trees with maximum algebraic connectivity
Applicable Analysis and Discrete Mathematics
2017-07-19Paper
Strictly interval graphs: characterization and linear time recognition2016-10-18Paper
Solving problems for maximal reducible flowgraphs2016-07-01Paper
New results on Ptolemaic graphs
Discrete Applied Mathematics
2015-09-30Paper
Generating and counting unlabeled \(k\)-path graphs
Discrete Applied Mathematics
2015-09-22Paper
Matching preclusion number in Cartesian product of graphs and its application to interconnection networks.2015-01-06Paper
An efficient representation of chordal graphs
Operations Research Letters
2014-05-14Paper
\(k\)-separator chordal graphs: leafage and subfamilies
International Transactions in Operational Research
2013-11-14Paper
Total coloring of block-cactus graphs2011-08-24Paper
One-phase algorithm for the determination of minimal vertex separators of chordal graphs
International Transactions in Operational Research
2011-05-20Paper
Prüfer code for chordal graphs2010-09-02Paper
New concepts and results on the average degree of a graph2009-10-22Paper
A clique-difference encoding scheme for labelled \(k\)-path graphs
Discrete Applied Mathematics
2009-03-04Paper
Two methods for the generation of chordal graphs
Annals of Operations Research
2008-09-03Paper
The Reduced Prüfer Code for Rooted Labelled k-Trees
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Subclasses of \(k\)-trees: characterization and recognition
Discrete Applied Mathematics
2006-04-28Paper
Solving problems for maximal reducible flowgraphs.
Discrete Applied Mathematics
2004-03-14Paper
Equilateral drawing of 2-connected planar chordal graphs2001-09-23Paper
Maxregularity and maximal outerplanar graphs2001-09-23Paper
scientific article; zbMATH DE number 1439428 (Why is no real title available?)2001-07-02Paper
scientific article; zbMATH DE number 1439470 (Why is no real title available?)2001-05-17Paper


Research outcomes over time


This page was built for person: Lilian Markenzon