R. Sritharan

Discret. Appl. Math., 2022

2019

Some completion problems for graphs without chordless cycles of prescribed lengths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On the contour of bipartite graphs.

[BibT_eX]

[DOI]

Danilo Artigas

Discret. Appl. Math., 2018

2017

Completing colored graphs to meet a target property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Graph modification problem for some classes of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

2015

Geodeticity of the contour of chordal bipartite graphs.

[BibT_eX]

[DOI]

Danilo Artigas

Electron. Notes Discret. Math., 2015

2013

Hamiltonian Spider Intersection Graphs Are Cycle Extendable.

[BibT_eX]

[DOI]

Chandra Mohan Krishnamurthy

SIAM J. Discret. Math., 2013

Finding and listing induced paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Finding a Sun in Building-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Maximum induced matching problem on hhd-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Strongly chordal and chordal bipartite graphs are sandwich monotone.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.

[BibT_eX]

[DOI]

Discret. Math., 2011

On graphs without a C4 or a diamond.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

A Min-Max Property of Chordal Bipartite Graphs with Applications.

[BibT_eX]

[DOI]

Graphs Comb., 2010

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

On graphs without a C4 or a diamond

[BibT_eX]

[DOI]

CoRR, 2009

2008

Structure and linear-time recognition of 4-leaf powers.

[BibT_eX]

[DOI]

Andreas Brandstädt

Van Bang Le

ACM Trans. Algorithms, 2008

Chordal bipartite completion of colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

A new characterization of HH-free graphs.

[BibT_eX]

[DOI]

Dieter Kratsch

Celina M. H. de Figueiredo

Discret. Math., 2008

Leaf Powers and Their Properties: Using the Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.

[BibT_eX]

[DOI]

Luérbio Faria

Sulamita Klein

Theor. Comput. Sci., 2007

The induced matching and chain subgraph cover problems for convex bipartite graphs.

[BibT_eX]

[DOI]

Andreas Brandstädt

Theor. Comput. Sci., 2007

Improved algorithms for weakly chordal graphs.

[BibT_eX]

[DOI]

Ryan B. Hayward

ACM Trans. Algorithms, 2007

The Complexity of the List Partition Problem for Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

An O(n 3)-Time Recognition Algorithm for hhds-free Graphs.

[BibT_eX]

[DOI]

Chính T. Hoàng

Graphs Comb., 2007

2006

Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

A note on the recognition of bisplit graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Disjoint clique cutsets in graphs without long holes.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

2004

The list partition problem for graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Planar domination graphs.

[BibT_eX]

[DOI]

William Klostermeyer

Discret. Math., 2003

Finding a maximum induced matching in weakly chordal graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Yingwen Tang

Discret. Math., 2003

Recognition of Some Perfectly Orderable Graph Classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

Dirac-type characterizations of graphs without long chordless cycles.

[BibT_eX]

[DOI]

Vasek Chvátal

Irena Rusu

Discret. Math., 2002

2001

Finding houses and holes in graphs.

[BibT_eX]

[DOI]

Chính T. Hoàng

Theor. Comput. Sci., 2001

2000

Weakly chordal graph algorithms via handles.

[BibT_eX]

[DOI]

Ryan Hayward

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Weakly Triangulated Comparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

1996

A linear time algorithm to recognize circular permutation graphs.

[BibT_eX]

[DOI]

Networks, 1996

1995

A Characterization of Some Graph Classes with No Long Holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Algorithms for Weakly Triangulated Graphs.

[BibT_eX]

[DOI]