Hikoe Enomoto

According to our database1, Hikoe Enomoto authored at least 60 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The graph grabbing game on Km, n-trees.
Discrete Mathematics, 2018

Pure-strategy Nash equilibria on competitive diffusion games.
Discrete Applied Mathematics, 2018

2017
Plane Triangulations Without a Spanning Halin Subgraph II.
SIAM J. Discrete Math., 2017

2015
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.
SIAM J. Discrete Math., 2015

2011
Spanning Trees with Bounded Total Excess.
Ars Comb., 2011

2010
The independence number condition for the existence of a spanning f-tree.
Journal of Graph Theory, 2010

2009
A general upper bound for the cyclic chromatic number of 3-connected plane graphs.
Journal of Graph Theory, 2009

Cycle-Partitions with Specified Vertices and Edges.
Ars Comb., 2009

Fan-type theorem for a long path passing through a specified vertex.
Ars Comb., 2009

2007
Independence number and vertex-disjoint cycles.
Discrete Mathematics, 2007

2005
Ore-type degree condition for heavy paths in weighted graphs.
Discrete Mathematics, 2005

A sk type condition for heavy cycles in weighted graphs.
Ars Comb., 2005

2004
Vertex-disjoint cycles containing specified vertices in a bipartite graph.
Journal of Graph Theory, 2004

Long cycles in triangle-free graphs with prescribed independence number and connectivity.
J. Comb. Theory, Ser. B, 2004

Partition of a graph into cycles and degenerated cycles.
Discrete Mathematics, 2004

2003
Two-factors each component of which contains a specified vertex.
Journal of Graph Theory, 2003

2002
Choice number of some complete multi-partite graphs.
Discrete Mathematics, 2002

On the decomposition dimension of trees.
Discrete Mathematics, 2002

Graph decompositions through prescribed vertices without isolates.
Ars Comb., 2002

2001
Cyclic Chromatic Number of 3-Connected Plane Graphs.
SIAM J. Discrete Math., 2001

Graph partition problems into cycles and paths.
Discrete Mathematics, 2001

Pairs of Disjoint q-element Subsets Far from Each Other.
Electr. J. Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.
Australasian J. Combinatorics, 2001

2000
Partitions of a graph into paths with prescribed endvertices and lengths.
Journal of Graph Theory, 2000

Complete-factors and f-factors.
Discrete Mathematics, 2000

Graph decompositions and D3-paths with a prescribed endvertex.
Discrete Mathematics, 2000

Toughness and the existence of k-factors. IV.
Discrete Mathematics, 2000

Induced Graph Theorem on Magic Valuations.
Ars Comb., 2000

1999
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine.
SIAM J. Discrete Math., 1999

Connected subgraphs with small degree sums in 3-connected planar graphs.
Journal of Graph Theory, 1999

Neighborhood unions and factor critical graphs.
Discrete Mathematics, 1999

Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph.
Discrete Applied Mathematics, 1999

1998
A Note on Difference Sets.
J. Comb. Theory, Ser. A, 1998

Toughness and the existence of k-factors. III.
Discrete Mathematics, 1998

Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem.
Discrete Applied Mathematics, 1998

On the Existence of Disjoint Cycles in a Graph.
Combinatorica, 1998

1997
Graph decompositions without isolated vertices III.
Journal of Graph Theory, 1997

Long cycles passing through a specified edge in a 3-connected graph.
Journal of Graph Theory, 1997

On the Pagenumber of Complete Bipartite Graphs.
J. Comb. Theory, Ser. B, 1997

1996
Connected Spanning Subgraphs of 3-Connected Planar Graphs.
J. Comb. Theory, Ser. B, 1996

1995
Degree Sums and Covering Cycles.
Journal of Graph Theory, 1995

Relative length of long paths and cycles in graphs with large degree sums.
Journal of Graph Theory, 1995

Graph Decompositions without Isolated Vertices.
J. Comb. Theory, Ser. B, 1995

Disjoint odd integer subsets having a constant even sum.
Discrete Mathematics, 1995

1992
A word problem in Artin semigroups.
Discrete Mathematics, 1992

1988
A sufficient condition for a bipartite graph to have a k-factor.
Journal of Graph Theory, 1988

Ck-factorization of complete bipartite graphs.
Graphs and Combinatorics, 1988

Factors and induced subgraphs.
Discrete Mathematics, 1988

Preface.
Discrete Mathematics, 1988

1987
Distance-regular digraphs of girth 4.
J. Comb. Theory, Ser. B, 1987

Contractible edges in 3-connected graphs.
J. Comb. Theory, Ser. B, 1987

1986
Toughness and the existence ofk-factors. II.
Graphs and Combinatorics, 1986

On component factors.
Graphs and Combinatorics, 1986

Contracible edges in triangle-free graphs.
Combinatorica, 1986

1985
Toughness and the existence of k-factors.
Journal of Graph Theory, 1985

1984
The linear arboricity of some regular graphs.
Journal of Graph Theory, 1984

Long paths and large cycles in finite graphs.
Journal of Graph Theory, 1984

Disjoint shortest paths in graphs.
Combinatorica, 1984

1981
Combinatorially homogeneous graphs.
J. Comb. Theory, Ser. B, 1981

1980
On Maximal Weights of Hadamard Matrices.
J. Comb. Theory, Ser. A, 1980


  Loading...