default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCésar Hernández-Cruz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini:
Trees with minimum weighted Szeged index. Art Discret. Appl. Math. 7(2): 2 (2024)- [j36]Santiago Guzmán-Pro
, César Hernández-Cruz:
Orientations without forbidden patterns on three vertices. Appl. Math. Comput. 480: 128912 (2024) - [j35]Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Panchromatic patterns by paths. Discuss. Math. Graph Theory 44(2): 519 (2024) - [j34]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs. Graphs Comb. 40(3): 53 (2024) - 2023
- [j33]Santiago Guzmán-Pro, Pavol Hell, César Hernández-Cruz:
Describing hereditary properties by forbidden circular orderings. Appl. Math. Comput. 438: 127555 (2023) - [j32]Juan Carlos García-Altamirano, César Hernández-Cruz:
Minimal obstructions for a matrix partition problem in chordal graphs. Discret. Appl. Math. 324: 58-66 (2023) - [c3]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Polarity on H-split graphs. LAGOS 2023: 184-192 - [c2]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Simple certifying algorithms for variants of the (2, 1)-colouring problem. LAGOS 2023: 292-301 - 2022
- [j31]César Hernández-Cruz, Mirko Petrusevski, Riste Skrekovski:
Notes on weak-odd edge colorings of digraphs. Ars Math. Contemp. 22(2): 2 (2022) - [j30]Santiago Guzmán-Pro, César Hernández-Cruz:
Oriented expressions of graph properties. Eur. J. Comb. 105: 103567 (2022) - [i9]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal obstructions for polarity, monopolarity, unipolarity and (s,1)-polarity in generalizations of cographs. CoRR abs/2203.04953 (2022) - 2021
- [j29]César Hernández-Cruz, Manuel Alejandro Juárez-Camacho:
Pancyclicity in strong k-quasi-transitive digraphs of large diameter. Appl. Math. Comput. 408: 126319 (2021) - [j28]Santiago Guzmán-Pro, César Hernández-Cruz:
Duality Pairs and Homomorphisms to Oriented and Unoriented Cycles. Electron. J. Comb. 28(3): 3 (2021) - [j27]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal obstructions to (∞, k)-polarity in cographs. Discret. Math. 344(7): 112407 (2021) - [j26]Jesús Alva-Samos, César Hernández-Cruz:
k-quasi-transitive digraphs of large diameter. J. Graph Theory 96(2): 310-325 (2021) - [j25]Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strong Chordality of Graphs with Possible Loops. SIAM J. Discret. Math. 35(1): 362-375 (2021) - [i8]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal obstructions to (∞, k)-polarity in cographs. CoRR abs/2104.07852 (2021) - [i7]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal obstructions to (s, 1)-polarity in cographs. CoRR abs/2104.07856 (2021) - 2020
- [j24]Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Minimal obstructions to (s, 1)-polarity in cographs. Discret. Appl. Math. 281: 111-117 (2020) - [c1]Pavol Hell, César Hernández-Cruz, Anurag Sanyal:
Partitioning Cographs into Two Forests and One Independent Set. CALDAM 2020: 15-27 - [i6]Santiago Guzmán-Pro, César Hernández-Cruz:
Duality pairs and homomorphisms to oriented and unoriented cycles. CoRR abs/2003.05605 (2020) - [i5]Santiago Guzmán-Pro, César Hernández-Cruz:
Orientations without forbidden patterns on three vertices. CoRR abs/2003.05606 (2020) - [i4]Juan Carlos García-Altamirano, César Hernández-Cruz:
Minimal obstructions for a matrix partition problem in chordal graphs. CoRR abs/2004.01229 (2020)
2010 – 2019
- 2019
- [j23]César Hernández-Cruz, Magdalena Lemanska, Rita Zuazua:
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set. Australas. J Comb. 73: 334-345 (2019) - [j22]Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales:
Minimal obstructions to 2-polar cographs. Discret. Appl. Math. 261: 219-228 (2019) - [j21]Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Characterization of color patterns by dynamic H-paths. Discret. Appl. Math. 267: 41-51 (2019) - [j20]Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
Mixed Cages. Graphs Comb. 35(5): 989-999 (2019) - [j19]Hortensia Galeana-Sánchez, César Hernández-Cruz:
A dichotomy for the kernel by H-walks problem in digraphs. J. Graph Theory 90(3): 213-226 (2019) - [j18]Sebastián González Hermosillo de la Maza, César Hernández-Cruz:
On the complexity of the k-kernel problem on cyclically k-partite digraphs. Theor. Comput. Sci. 795: 9-19 (2019) - [i3]Sebastián González Hermosillo de la Maza, Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini, Payam Valadkhan:
Vertex arboricity of cographs. CoRR abs/1907.07286 (2019) - [i2]Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strongly chordal digraphs and Γ-free matrices. CoRR abs/1909.03597 (2019) - 2018
- [j17]Sebastián González Hermosillo de la Maza, César Hernández-Cruz:
On the existence of 3- and 4-kernels in digraphs. Discret. Math. 341(3): 638-651 (2018) - [p1]Hortensia Galeana-Sánchez, César Hernández-Cruz:
Quasi-Transitive Digraphs and Their Extensions. Classes of Directed Graphs 2018: 341-404 - 2017
- [j16]Pavol Hell, César Hernández-Cruz:
Strict chordal and strict split digraphs. Discret. Appl. Math. 216: 609-617 (2017) - [j15]Ana Paulina Figueroa, César Hernández-Cruz, Mika Olsen:
The minimum feedback arc set problem and the acyclic disconnection for graphs. Discret. Math. 340(7): 1514-1521 (2017) - [j14]Patricio Ricardo Garcia-Vázquez, César Hernández-Cruz:
Some results on 4-transitive digraphs. Discuss. Math. Graph Theory 37(1): 117-129 (2017) - [j13]Tomás Feder, Pavol Hell, César Hernández-Cruz:
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60: 55-65 (2017) - [j12]César Hernández-Cruz, Jesús Alva-Samos:
k-quasi-transitive digraphs of large diameter. Electron. Notes Discret. Math. 62: 213-218 (2017) - [j11]Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
The Strong Convexity Spectra of Grids. Graphs Comb. 33(4): 689-713 (2017) - 2015
- [j10]Pavol Hell, César Hernández-Cruz:
Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. Discret. Math. 338(10): 1755-1762 (2015) - 2014
- [j9]Pavol Hell, César Hernández-Cruz:
On the complexity of the 3-kernel problem in some classes of digraphs. Discuss. Math. Graph Theory 34(1): 167-185 (2014) - [j8]Hortensia Galeana-Sánchez, César Hernández-Cruz:
On the existence of (k, l)-kernels in infinite digraphs: A survey. Discuss. Math. Graph Theory 34(3): 431-466 (2014) - [j7]César Hernández-Cruz, Juan José Montellano-Ballesteros:
On the structure of strong k-transitive digraphs. Discuss. Math. Graph Theory 34(4): 651-671 (2014) - 2013
- [j6]Hortensia Galeana-Sánchez, César Hernández-Cruz, Manuel Alejandro Juárez-Camacho:
On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs. Discret. Math. 313(22): 2582-2591 (2013) - [j5]César Hernández-Cruz:
4-transitive digraphs I: the structure of strong 4-transitive digraphs. Discuss. Math. Graph Theory 33(2): 247-260 (2013) - 2012
- [j4]César Hernández-Cruz, Hortensia Galeana-Sánchez:
k-kernels in k-transitive and k-quasi-transitive digraphs. Discret. Math. 312(16): 2522-2530 (2012) - [j3]César Hernández-Cruz:
3-transitive digraphs. Discuss. Math. Graph Theory 32(2): 205-219 (2012) - [i1]César Hernández-Cruz, Hortensia Galeana-Sánchez, Manuel Alejandro Juárez-Camacho:
On the existence and number of (k+1)-kings in k-quasi-transitive digraphs. CoRR abs/1206.1897 (2012) - 2011
- [b1]César Hernández-Cruz:
A contribution to the theory of (k;l)-kernels in digraphs. UNAM, Mexico, 2011 - [j2]Hortensia Galeana-Sánchez, César Hernández-Cruz:
Cyclically k-partite digraphs and k-kernels. Discuss. Math. Graph Theory 31(1): 63-78 (2011) - [j1]Hortensia Galeana-Sánchez, César Hernández-Cruz:
k-kernels in generalizations of transitive digraphs. Discuss. Math. Graph Theory 31(2): 293-312 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
