Lilian Markenzon

According to our database1, Lilian Markenzon authored at least 27 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Non-inclusion and other subclasses of chordal graphs.
Discret. Appl. Math., 2020

Integer Laplacian eigenvalues of strictly chordal graphs.
CoRR, 2020

2019
Toughness and Hamiltonicity of strictly chordal graphs.
Int. Trans. Oper. Res., 2019

Block-indifference graphs: Characterization, structural and spectral properties.
Discret. Appl. Math., 2019

Integer Laplacian Eigenvalues of Chordal Graphs.
CoRR, 2019

2018
Vulnerability of Subclasses of Chordal Graphs.
Electron. Notes Discret. Math., 2018

2017
Counting and enumerating unlabeled split-indifference graphs.
Discret. Math. Algorithms Appl., 2017

2016
Strictly Interval Graphs: Characterization and Linear Time Recognition.
Electron. Notes Discret. Math., 2016

2015
New results on ptolemaic graphs.
Discret. Appl. Math., 2015

2014
Generating and counting unlabeled k-path graphs.
Discret. Appl. Math., 2014

2013
An efficient representation of chordal graphs.
Oper. Res. Lett., 2013

<i>k</i>-separator chordal graphs: leafage and subfamilies.
Int. Trans. Oper. Res., 2013

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.
Ars Comb., 2013

2010
One-phase algorithm for the determination of minimal vertex separators of chordal graphs.
Int. Trans. Oper. Res., 2010

2009
Recognition of Reducible Flow Hypergraphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Flow Hypergraph Reducibility.
Electron. Notes Discret. Math., 2008

A clique-difference encoding scheme for labelled k-path graphs.
Discret. Appl. Math., 2008

Two methods for the generation of chordal graphs.
Ann. Oper. Res., 2008

A Compact Representation for Chordal Graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2006
Subclasses of <i>k</i>-trees: Characterization and recognition.
Discret. Appl. Math., 2006

2005
The Reduced Prüfer Code for Rooted Labelled k-Trees.
Electron. Notes Discret. Math., 2005

2001
Solving Problems for Maximal Reducible Flowgraphs.
Electron. Notes Discret. Math., 2001

A Cryptographic Code Based on Digraphs.
Electron. Notes Discret. Math., 2001

1999
Maxregularity and Maximal Outerplanar Graphs.
Electron. Notes Discret. Math., 1999

Equilateral Drawing of 2-Connected Planar Chordal Graphs.
Electron. Notes Discret. Math., 1999

1998
On Some Path Problems on Oriented Hypergraphs.
RAIRO Theor. Informatics Appl., 1998

1997
Hamiltonian Problems for Reducible Flowgraphs.
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997


  Loading...