56 citations · 204 across the 25 of their papers we have counts for
3 papers · 1 filter
Reconstructing Graphs from Connected Triples
Paul Bastide, Linda Cook, Jeff Erickson +4
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In…
Embedded-width: A variant of treewidth for plane graphs
Glencora Borradaile, Jeff Erickson, Hung Le +1
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call t…
Distance-2 Edge Coloring is NP-Complete
Jeff Erickson, Shripad Thite, David P. Bunde
We prove that it is NP-complete to determine whether there exists a distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite 2-inductive graph with girth 6 and…