Marisa Gutierrez

Fábio Protti

Rudini Menezes Sampaio

Discret. Appl. Math., 2025

2024

Diclique digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., February, 2024

Computing the hull and interval numbers in the weakly toll convexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

On walk domination: weakly toll domination, l2 and l3 domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2024

2023

The neighbor-locating-chromatic number of trees and unicyclic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Convex geometries over induced paths with bounded length.

[BibT_eX]

[DOI]

Fábio Protti

Discret. Math., 2023

2022

On dually-CPT and strong-CPT posets.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Vincent Limouzy

CoRR, 2022

Weakly toll convexity and proper interval graphs.

[BibT_eX]

[DOI]

CoRR, 2022

2021

On k-tree Containment Graphs of Paths in a Tree.

[BibT_eX]

[DOI]

Order, 2021

2020

Neighbor-locating colorings in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs.

[BibT_eX]

[DOI]

Martin Milanic

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Neighbor-locating coloring: graph operations and extremal cardinalities.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Recent results on containment graphs of paths in a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Helly EPT graphs on bounded degree trees: Characterization and recognition.

[BibT_eX]

[DOI]

Discret. Math., 2017

Pebbling in semi-2-trees.

[BibT_eX]

[DOI]

Glenn Hurlbert

Discret. Math., 2017

2016

On Models of Directed Path Graphs Non Rooted Directed Path Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

End simplicial vertices in path graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

On basic chordal graphs and some of its subclasses.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Strong cliques and equistability of EPT graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Helly EPT graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Pebbling in 2-Paths.

[BibT_eX]

[DOI]

Glenn Hurlbert

Electron. Notes Discret. Math., 2015

On containment graphs of paths in a tree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Toll convexity.

[BibT_eX]

[DOI]

Tadeja Kraner Sumenjak

Iztok Peterin

Aleksandra Tepeh

Eur. J. Comb., 2015

Asteroidal quadruples in non rooted path graphs.

[BibT_eX]

[DOI]

Benjamin Lévêque

Discuss. Math. Graph Theory, 2015

Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Determining possible sets of leaves for spanning trees of dually chordal graphs.

[BibT_eX]

Ars Comb., 2015

2014

Pebbling in Split Graphs.

[BibT_eX]

[DOI]

Glenn H. Hurlbert

SIAM J. Discret. Math., 2014

Special Eccentric Vertices for the Class of Chordal Graphs and Related Classes.

[BibT_eX]

[DOI]

Graphs Comb., 2014

On the correspondence between tree representations of chordal and dually chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Recognizing vertex intersection graphs of paths on bounded degree trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Split clique graph complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Special asteroidal quadruple on directed path graph non rooted path graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Introducing subclasses of basic chordal graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On minimal non [h, 2, 1] graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Determining what sets of trees can be the clique trees of a chordal graph.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2012

Finding intersection models: From chordal to Helly circular-arc graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

On minimal vertex separators of dually chordal graphs: Properties and characterizations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Comparing trees characteristic to chordal and dually chordal graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

From Path Graphs to Directed Path Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

The complexity of clique graph recognition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Minimal vertex separators and new characterizations for dually chordal graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Clique trees of chordal graphs: leafage and 3-asteroidals.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2007

On transitive orientations with restricted covering graphs.

[BibT_eX]

[DOI]

Maria Patricia Dobson

Michel Habib

Inf. Process. Lett., 2007

Tree loop graphs.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Discret. Appl. Math., 2007

2006

Clique Graph Recognition Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

A forbidden subgraph characterization of path graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Non loop graphs with induced cycles.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Electron. Notes Discret. Math., 2005

Loop Graphs and Asteroidal Sets.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Electron. Notes Discret. Math., 2005

2004

Treelike Comparability Graphs.

[BibT_eX]

[DOI]

Maria Patricia Dobson

Electron. Notes Discret. Math., 2004

Cliques and extended triangles. A necessary condition for planar clique graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Clique Graphs of Planar Graphs.

[BibT_eX]

Ars Comb., 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Ton Kloks

Rolf Niedermeier

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Recognizing clique graphs of directed edge path graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

On clique graph recognition.

[BibT_eX]

Ars Comb., 2002

2001

Algebraic theory for the clique operator.

[BibT_eX]

J. Braz. Comput. Soc., 2001

Intersection Graphs and the Clique Operator.

[BibT_eX]

Graphs Comb., 2001

The Clique Operator, Set Families, and Their Properties.

[BibT_eX]

[DOI]

Joao Meidanis

Electron. Notes Discret. Math., 2001

Clique Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

1998

On the Clique Operator.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1996

Metric characterizations of proper interval graphs and tree-clique graphs.

[BibT_eX]

[DOI]

Lía Oubiña

J. Graph Theory, 1996

1995

Minimum proper interval graphs.

[BibT_eX]

[DOI]