John G. Gimbel

Affiliations:
  • University of Alaska, Fairbanks, AK, USA


According to our database1, John G. Gimbel authored at least 32 papers between 1985 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sparse Sets in Triangle-free Graphs.
CoRR, 2024

2022
Fractional Cocoloring of Graphs.
Graphs Comb., 2022

2021
Exact values of defective Ramsey numbers in graph classes.
Discret. Optim., 2021

2019
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.
SIAM J. Discret. Math., 2019

Small 1-defective Ramsey numbers in perfect graphs.
Discret. Optim., 2019

2017
Graphs with Obstacle Number Greater than One.
J. Graph Algorithms Appl., 2017

Obstacle Numbers of Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Uniquely Tree-saturated Graphs.
Graphs Comb., 2016

2014
On cycle packings and feedback vertex sets.
Contributions Discret. Math., 2014

2013
Some Defective Parameters in Graphs.
Graphs Comb., 2013

2010
Covering line graphs with equivalence relations.
Discret. Appl. Math., 2010

2009
Partitioning graphs into complete and empty graphs.
Discret. Math., 2009

On the computation of the hull number of a graph.
Discret. Math., 2009

2008
Bounds on the metric and partition dimensions of a graph.
Ars Comb., 2008

2003
Some Remarks on the Convexity Number of a Graph.
Graphs Comb., 2003

Subcolorings and the subchromatic number of a graph.
Discret. Math., 2003

2002
Partitions of Graphs into Cographs.
Electron. Notes Discret. Math., 2002

A note on transitive orientations with maximum sets of sources and sinks.
Discret. Appl. Math., 2002

2000
Coloring triangle-free graphs with fixed size.
Discret. Math., 2000

1999
Linear-time Algorithms for Maximum Sets of Sources and sinks.
Electron. Notes Discret. Math., 1999

Even and Odd Pairs in Comparability and in P4-comparability Graphs.
Discret. Appl. Math., 1999

1998
On the Weakness of an Ordered Set.
SIAM J. Discret. Math., 1998

1997
Double total domination of graphs.
Discret. Math., 1997

Switching Distance Graphs.
Ars Comb., 1997

1994
Independent edges in bipartite graphs obtained from orientations of graphs.
J. Graph Theory, 1994

On Cocolourings and Cochromatic Numbers of Graphs.
Discret. Appl. Math., 1994

1991
Some extremal results in cochromatic and dichromatic theory.
J. Graph Theory, 1991

Matchings and cycle covers in random digraphs.
Discret. Appl. Math., 1991

1990
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number.
Eur. J. Comb., 1990

1988
End vertices in interval graphs.
Discret. Appl. Math., 1988

1987
Some topics in cochromatic theory.
Graphs Comb., 1987

1985
Homogeneously representable interval graphs.
Discret. Math., 1985


  Loading...