César Hernández-Cruz

Orcid: 0000-0002-5867-3801

According to our database1, César Hernández-Cruz authored at least 45 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Panchromatic patterns by paths.
Discuss. Math. Graph Theory, 2024

Orientations without forbidden patterns on three vertices.
Appl. Math. Comput., 2024

Trees with minimum weighted Szeged index.
Art Discret. Appl. Math., 2024

2023
Minimal obstructions for a matrix partition problem in chordal graphs.
Discret. Appl. Math., 2023

Describing hereditary properties by forbidden circular orderings.
Appl. Math. Comput., 2023

Simple certifying algorithms for variants of the (2, 1)-colouring problem.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Polarity on H-split graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Oriented expressions of graph properties.
Eur. J. Comb., 2022

Notes on weak-odd edge colorings of digraphs.
Ars Math. Contemp., 2022

2021
Strong Chordality of Graphs with Possible Loops.
SIAM J. Discret. Math., 2021

k-quasi-transitive digraphs of large diameter.
J. Graph Theory, 2021

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

Duality Pairs and Homomorphisms to Oriented and Unoriented Cycles.
Electron. J. Comb., 2021

Pancyclicity in strong k-quasi-transitive digraphs of large diameter.
Appl. Math. Comput., 2021

2020
Minimal obstructions to (s, 1)-polarity in cographs.
Discret. Appl. Math., 2020

Partitioning Cographs into Two Forests and One Independent Set.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
On the complexity of the <i>k</i>-kernel problem on cyclically <i>k</i>-partite digraphs.
Theor. Comput. Sci., 2019

A dichotomy for the kernel by H-walks problem in digraphs.
J. Graph Theory, 2019

Mixed Cages.
Graphs Comb., 2019

Minimal obstructions to 2-polar cographs.
Discret. Appl. Math., 2019

Characterization of color patterns by dynamic H-paths.
Discret. Appl. Math., 2019

Strongly chordal digraphs and Γ-free matrices.
CoRR, 2019

Vertex arboricity of cographs.
CoRR, 2019

A characterization of trees having a minimum vertex cover which is also a minimum total dominating set.
Australas. J Comb., 2019

2018
On the existence of 3- and 4-kernels in digraphs.
Discret. Math., 2018

Quasi-Transitive Digraphs and Their Extensions.
Proceedings of the Classes of Directed Graphs., 2018

2017
The Strong Convexity Spectra of Grids.
Graphs Comb., 2017

<i>k</i>-quasi-transitive digraphs of large diameter.
Electron. Notes Discret. Math., 2017

Colourings, homomorphisms, and partitions of transitive digraphs.
Eur. J. Comb., 2017

Some results on 4-transitive digraphs.
Discuss. Math. Graph Theory, 2017

The minimum feedback arc set problem and the acyclic disconnection for graphs.
Discret. Math., 2017

Strict chordal and strict split digraphs.
Discret. Appl. Math., 2017

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

2014
On the structure of strong <i>k</i>-transitive digraphs.
Discuss. Math. Graph Theory, 2014

On the complexity of the 3-kernel problem in some classes of digraphs.
Discuss. Math. Graph Theory, 2014

On the existence of (<i>k, l</i>)-kernels in infinite digraphs: A survey.
Discuss. Math. Graph Theory, 2014

2013
4-transitive digraphs I: the structure of strong 4-transitive digraphs.
Discuss. Math. Graph Theory, 2013

On the existence and number of (<i>k</i>+1)(k+1)-kings in <i>k</i>k-quasi-transitive digraphs.
Discret. Math., 2013

2012
3-transitive digraphs.
Discuss. Math. Graph Theory, 2012

k-kernels in k-transitive and k-quasi-transitive digraphs.
Discret. Math., 2012

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

2011
A contribution to the theory of (k;l)-kernels in digraphs
PhD thesis, 2011

<i>k</i>-kernels in generalizations of transitive digraphs.
Discuss. Math. Graph Theory, 2011

Cyclically k-partite digraphs and k-kernels.
Discuss. Math. Graph Theory, 2011


  Loading...