César Hernández-Cruz

Discret. Appl. Math., 2025

2024

Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs.

[BibT_eX]

[DOI]

Graphs Comb., May, 2024

2-polarity and algorithmic aspects of polarity variants on cograph superclasses.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2024

Panchromatic patterns by paths.

[BibT_eX]

[DOI]

Germán Benítez-Bobadilla

Discuss. Math. Graph Theory, 2024

Orientations without forbidden patterns on three vertices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

Trees with minimum weighted Szeged index.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Art Discret. Appl. Math., 2024

2023

Minimal obstructions for a matrix partition problem in chordal graphs.

[BibT_eX]

[DOI]

Juan Carlos García-Altamirano

Discret. Appl. Math., 2023

Describing hereditary properties by forbidden circular orderings.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2023

Simple certifying algorithms for variants of the (2, 1)-colouring problem.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Polarity on H-split graphs.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Oriented expressions of graph properties.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Notes on weak-odd edge colorings of digraphs.

[BibT_eX]

[DOI]

Mirko Petrusevski

Riste Skrekovski

Ars Math. Contemp., 2022

2021

Strong Chordality of Graphs with Possible Loops.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

k-quasi-transitive digraphs of large diameter.

[BibT_eX]

[DOI]

Jesús Alva-Samos

J. Graph Theory, 2021

Minimal obstructions to (∞, k)-polarity in cographs.

[BibT_eX]

[DOI]

Discret. Math., 2021

Duality Pairs and Homomorphisms to Oriented and Unoriented Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Pancyclicity in strong k-quasi-transitive digraphs of large diameter.

[BibT_eX]

[DOI]

Manuel Alejandro Juárez-Camacho

Appl. Math. Comput., 2021

2020

Minimal obstructions to (s, 1)-polarity in cographs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Partitioning Cographs into Two Forests and One Independent Set.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

Anurag Sanyal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

On the complexity of the k-kernel problem on cyclically k-partite digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A dichotomy for the kernel by H-walks problem in digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Mixed Cages.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

Juan José Montellano-Ballesteros

Graphs Comb., 2019

Minimal obstructions to 2-polar cographs.

[BibT_eX]

[DOI]

Cláudia Linhares Sales

Discret. Appl. Math., 2019

Characterization of color patterns by dynamic H-paths.

[BibT_eX]

[DOI]

Germán Benítez-Bobadilla

Sebastián González Hermosillo de la Maza

Discret. Appl. Math., 2019

Strongly chordal digraphs and Γ-free matrices.

[BibT_eX]

[DOI]

CoRR, 2019

Vertex arboricity of cographs.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Payam Valadkhan

CoRR, 2019

A characterization of trees having a minimum vertex cover which is also a minimum total dominating set.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

Magdalena Lemanska

Rita Zuazua

Australas. J Comb., 2019

2018

On the existence of 3- and 4-kernels in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Quasi-Transitive Digraphs and Their Extensions.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

The Strong Convexity Spectra of Grids.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

Juan José Montellano-Ballesteros

Graphs Comb., 2017

k-quasi-transitive digraphs of large diameter.

[BibT_eX]

[DOI]

Jesús Alva-Samos

Electron. Notes Discret. Math., 2017

Colourings, homomorphisms, and partitions of transitive digraphs.

[BibT_eX]

[DOI]

Tomás Feder

Patricio Ricardo Garcia-Vázquez

Eur. J. Comb., 2017

Some results on 4-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

The minimum feedback arc set problem and the acyclic disconnection for graphs.

[BibT_eX]

[DOI]

Ana Paulina Figueroa

Mika Olsen

Discret. Math., 2017

Strict chordal and strict split digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2015

Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

On the structure of strong k-transitive digraphs.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Discuss. Math. Graph Theory, 2014

On the complexity of the 3-kernel problem in some classes of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

On the existence of (k, l)-kernels in infinite digraphs: A survey.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

2013

4-transitive digraphs I: the structure of strong 4-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs.

[BibT_eX]

[DOI]

Manuel Alejandro Juárez-Camacho

Discret. Math., 2013

2012

3-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

k-kernels in k-transitive and k-quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

On the existence and number of (k+1)-kings in k-quasi-transitive digraphs

[BibT_eX]

[DOI]

Manuel Alejandro Juárez-Camacho

CoRR, 2012

2011

A contribution to the theory of (k;l)-kernels in digraphs

[BibT_eX]

[DOI]

PhD thesis, 2011

k-kernels in generalizations of transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Cyclically k-partite digraphs and k-kernels.

[BibT_eX]

[DOI]