Hikoe Enomoto

From MaRDI portal
Person:186104

Available identifiers

zbMath Open enomoto.hikoeMaRDI QIDQ186104

List of research outcomes

PublicationDate of PublicationType
Game chromatic number of strong product graphs2022-11-02Paper
Pure-strategy Nash equilibria on competitive diffusion games2018-05-24Paper
The graph grabbing game on \(K_{m, n}\)-trees2018-04-19Paper
Plane Triangulations Without a Spanning Halin Subgraph II2017-11-02Paper
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs2015-08-17Paper
https://portal.mardi4nfdi.de/entity/Q29279322014-11-05Paper
https://portal.mardi4nfdi.de/entity/Q46499872012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q30117022011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30735532011-02-11Paper
The independence number condition for the existence of a spanning f-tree2011-01-19Paper
A general upper bound for the cyclic chromatic number of 3‐connected plane graphs2009-12-18Paper
Independence number and vertex-disjoint cycles2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q54925862006-10-16Paper
Ore-type degree condition for heavy paths in weighted graphs2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q54614942005-07-26Paper
Long cycles in triangle-free graphs with prescribed independence number and connectivity2004-08-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph2004-08-04Paper
Partition of a graph into cycles and degenerated cycles2004-02-14Paper
Two‐factors each component of which contains a specified vertex2003-07-31Paper
On the decomposition dimension of trees2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45522102002-08-29Paper
Choice number of some complete multi-partite graphs2002-05-21Paper
Graph partition problems into cycles and paths2002-05-20Paper
Pairs of disjoint \(q\)-element subsets far from each other2001-10-16Paper
Cyclic Chromatic Number of 3-Connected Plane Graphs2001-03-19Paper
Toughness and the existence of \(k\)-factors. III2000-11-02Paper
Partitions of a graph into paths with prescribed endvertices and lengths2000-09-20Paper
Complete factors and \(f\)-factors2000-08-28Paper
Graph decompositions and \(D_3\)-paths with a prescribed endvertex2000-06-22Paper
Extremal 2-connected graphs with given diameter2000-05-10Paper
Neighborhood unions and factor critical graphs2000-04-09Paper
Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph2000-04-09Paper
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine1999-11-23Paper
On the existence of disjoint cycles in a graph1999-10-31Paper
Connected subgraphs with small degree sums in 3-connected planar graphs1999-07-07Paper
A note on difference sets1999-05-09Paper
https://portal.mardi4nfdi.de/entity/Q42366131999-03-28Paper
Graph decompositions without isolated vertices. II1999-02-11Paper
Pyramidal tours with step-backs and the asymmetric traveling salesman problem1998-12-13Paper
On the pagenumber of complete bipartite graphs1998-05-24Paper
Connected spanning subgraphs of 3-connected planar graphs1997-05-04Paper
Graph decompositions without isolated vertices III1997-04-08Paper
Relative length of long paths and cycles in graphs with large degree sums1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48738191996-04-22Paper
Degree Sums and Covering Cycles1996-01-01Paper
Disjoint odd integer subsets having a constant even sum1995-08-27Paper
Graph decompositions without isolated vertices1995-07-02Paper
The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint1995-03-27Paper
The Schur indices of the irreducible characters of \(G_ 2(2^ n)\)1994-08-08Paper
https://portal.mardi4nfdi.de/entity/Q42945841994-05-30Paper
https://portal.mardi4nfdi.de/entity/Q46966191993-06-29Paper
A word problem in Artin semigroups1993-01-16Paper
Factors and induced subgraphs1988-01-01Paper
\(C_ k\)-factorization of complete bipartite graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113481988-01-01Paper
A sufficient condition for a bipartite graph to have a k‐factor1988-01-01Paper
Preface1988-01-01Paper
Contractible edges in 3-connected graphs1987-01-01Paper
Distance-regular digraphs of girth 41987-01-01Paper
On component factors1986-01-01Paper
Toughness and the existence of k-factors. II1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47222581986-01-01Paper
Toughness and the existence ofk-factors1985-01-01Paper
Disjoint shortest paths in graphs1984-01-01Paper
Long paths and large cycles in finite graphs1984-01-01Paper
The linear arboricity of some regular graphs1984-01-01Paper
Combinatorially homogeneous graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330051981-01-01Paper
On maximal weights of Hadamard matrices1980-01-01Paper
Tight 4-designs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41633771976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40756461974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56824641973-01-01Paper
The characters of the finite symplectic group Sp(4,q), q=2\(^f\)1972-01-01Paper
Strongly regular graphs and finite permutation groups of rank 31971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56528871970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56508571969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56508561968-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hikoe Enomoto