Sciweavers

29 search results - page 6 / 6
» jgt 2008
Sort
View
JGT
2008
77views more  JGT 2008»
13 years 5 months ago
List-coloring the square of a subcubic graph
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
Daniel W. Cranston, Seog-Jin Kim
JGT
2008
88views more  JGT 2008»
13 years 5 months ago
On k-detour subgraphs of hypercubes
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...
Nana Arizumi, Peter Hamburger, Alexandr V. Kostoch...
JGT
2008
97views more  JGT 2008»
13 years 5 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
JGT
2008
59views more  JGT 2008»
13 years 5 months ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...