James M. Carraher

Orcid: 0000-0003-0877-9840

Affiliations:

Department of Mathematics, University of Nebraska-Lincoln, USA

According to our database¹, James M. Carraher authored at least 8 papers between 2012 and 2021.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2021

Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2017

Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three.

[BibT_eX]

[DOI]

James M. Carraher

Stephen G. Hartke

SIAM J. Discret. Math., 2017

The Game Saturation Number of a Graph.

[BibT_eX]

[DOI]

James M. Carraher

William B. Kinnersley

Benjamin Reiniger

Douglas B. West

J. Graph Theory, 2017

2016

Edge-disjoint rainbow spanning trees in complete graphs.

[BibT_eX]

[DOI]

James M. Carraher

Stephen G. Hartke

Paul Horn

Eur. J. Comb., 2016

On the independence ratio of distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Sum-Paintability of Generalized Theta-Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

2013

Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs.

[BibT_eX]

[DOI]

James M. Carraher

Stephen G. Hartke

SIAM J. Discret. Math., 2013

2012

Locating a robber on a graph via distance queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

James M. Carraher

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...