On two variants of split graphs : 2-unipolar graph and k-probe-split graph

Revista con referato

Guardado en:

Detalles Bibliográficos
Autores principales:	Grippo, Luciano Norberto, Moyano, Verónica A.
Formato:	Artículo publishedVersion
Lenguaje:	Inglés
Publicado:	EDP Sciences 2026
Materias:	2-unipolar graph K-probe-split graph Split-width Matemáticas Matemática Aplicada
Acceso en línea:	http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/2670
Aporte de:	Repositorio Institucional Digital de Acceso Abierto (UNGS) de Universidad Nacional de General Sarmiento

Ejemplares similares

On split clique graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2010)

Pebbling in Split Graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2014)

Split clique graph complexity
por: Alcón, Liliana Graciela, et al.
Publicado: (2013)

On probe 2-clique graphs and probe diamond-free graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)

On probe 2-clique graphs and probe diamond-free graphs
por: Bonomo, F., et al.

Neighbor-locating coloring: graph operations and extremal cardinalities
por: Hernando, Carmen, et al.
Publicado: (2018)

Characterization of classical graph classes by weighted clique graphs
por: Bonomo, F., et al.

Characterization of classical graph classes by weighted clique graphs
por: Bonomo, Flavia
Publicado: (2014)

Probe interval graphs and probe unit interval graphs on superclasses of cographs
por: Bonomo, F., et al.

Probe interval graphs and probe unit interval graphs on superclasses of cographs
por: Bonomo, Flavia, et al.
Publicado: (2013)

Complexity of the cluster deletion problem on subclasses of chordal graphs
por: Bonomo, F., et al.

Complexity of the cluster deletion problem on subclasses of chordal graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)

Probe interval and probe unit interval graphs on superclasses of cographs
por: Durán, G., et al.

Probe interval and probe unit interval graphs on superclasses of cographs
por: Durán, Guillermo A., et al.
Publicado: (2011)

On clique-perfect and K-perfect graphs
por: Bonomo, F., et al.

On clique-perfect and K-perfect graphs
por: Bonomo, Flavia, et al.
Publicado: (2006)

Graph classes with and without powers of bounded clique-width
por: Bonomo, Flavia, et al.
Publicado: (2016)

Graph classes with and without powers of bounded clique-width
por: Bonomo, F., et al.

On clique‐inverse graphs of graphs with bounded clique number
por: Alcón, Liliana Graciela, et al.
Publicado: (2020)

Graph classes with and without powers of bounded clique-width
por: Bonomo, Flavia, et al.
Publicado: (2024)

k-tuple chromatic number of the cartesian product of graphs
por: Bonomo, F., et al.

k-tuple chromatic number of the cartesian product of graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)

The difference between clique graphs and iterated clique graphs
por: De Caria, Pablo Jesús
Publicado: (2011)

k-tuple colorings of the Cartesian product of graphs
por: Bonomo, F., et al.

k-tuple colorings of the Cartesian product of graphs
por: Bonomo, Flavia, et al.
Publicado: (2017)

On k-tree Containment Graphs of Paths in a Tree
por: Alcón, Liliana Graciela, et al.
Publicado: (2020)

Estudio del operador biclique aplicado a distintas clases de grafos
por: Puppo, Juan Pablo Damián
Publicado: (2019)

Estudio del operador biclique aplicado a distintas clases de grafos
por: Puppo, Juan Pablo Damián
Publicado: (2018)

Estudio del operador biclique aplicado a distintas clases de grafos
por: Puppo, Juan Pablo Damián
Publicado: (2019)

On the Complexity of {k}-domination for Chordal Graphs
por: Argiroffo, G., et al.
Publicado: (2013)

Intersection Graphs and the Clique Operator
por: Gutiérrez, Marisa
Publicado: (2001)

Proper circular arc graphs as intersection graphs of pathson a grid
por: Galby, Esther, et al.
Publicado: (2019)

Domination parameters with number 2 : interrelations and algorithmic consequences
por: Bonomo, Flavia, et al.
Publicado: (2024)

EPT graphs on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014)

End simplicial vertices in path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016)

Helly EPT graphs on bounded degree trees : Characterization and recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2017)

Strong cliques and equistability of EPT graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2016)

Clique graph recognition is NP-complete
por: Alcón, Liliana Graciela, et al.
Publicado: (2006)

Characterization and recognition of Helly circular-arc clique-perfect graphs
por: Bonomo, F., et al.

Characterization and recognition of Helly circular-arc clique-perfect graphs
por: Bonomo, Flavia, et al.
Publicado: (2005)