| Publication | Date of Publication | Type |
|---|
On some classes of quasi-triangulated graphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
Discrete Applied Mathematics | 2022-06-21 | Paper |
Efficient domination for classes of \(P_6\)-free graphs
Discrete Applied Mathematics | 2021-06-07 | Paper |
Completing colored graphs to meet a target property
Discrete Applied Mathematics | 2021-06-07 | Paper |
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
| The list partition problem for graphs | 2015-08-03 | Paper |
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
Completing colored graphs to meet a target property
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Finding a sun in building-free graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
On graphs without a \(C_{4}\) or a diamond
Discrete Applied Mathematics | 2011-04-19 | Paper |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Discrete Mathematics | 2011-02-18 | Paper |
| Group connectivity of certain graphs | 2011-02-02 | Paper |
\(2K_{2}\) vertex-set partition into nonempty parts
Discrete Mathematics | 2010-04-27 | Paper |
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
The \(s\)-Hamiltonian index
Discrete Mathematics | 2008-09-04 | Paper |
2K2 vertex-set partition into nonempty parts
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
Finding Triangles in Restricted Classes of Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5130726 (Why is no real title available?) | 2007-03-05 | Paper |
Disjoint clique cutsets in graphs without long holes
Journal of Graph Theory | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2104715 (Why is no real title available?) | 2004-10-01 | Paper |
Planar domination graphs
Discrete Mathematics | 2003-07-29 | Paper |
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics | 2003-06-10 | Paper |
Perfect codes and independent dominating sets
Congressus Numerantium | 2002-01-02 | Paper |
Weakly Triangulated Comparability Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
A characterization of some graph classes with no long holes
Journal of Combinatorial Theory. Series B | 1996-07-28 | Paper |
| scientific article; zbMATH DE number 437537 (Why is no real title available?) | 1993-12-15 | Paper |
