What people are saying - Write a review
We haven't found any reviews in the usual places.
Every Outerplanar Graph is the Union of Two Interval Graphs
Fault Tolerant Routing in SplitStars and Alternating Group Graphs
A Survey of Graph Pebbling by Glenn H Hurlbert
7 other sections not shown
Other editions - View all
2-pebbling property 5-lines adjacent algorithm ambiguous bits arity bead canonical tree complete graph Computer CONGRESSUS NUMERANTIUM Conjecture consider contains Corollary cubic graph D(pend(T decode information defined denote diameter discs disjoint edge colorable edge-induced subgraphs element equation equivalence class exists extended binary tree faults flat FLS(v FLSs geometric lattice graph G Graph Theory Hamiltonian path hash families Hence hG(S Huffman tree internal nodes intersection intersection graphs interval graphs isomorphic join congruence relation Jr(G k-factor kITI least Lemma Let G Math matroid maximal independent sets maximal reducible flowgraphs maximum modular cut move pairs parallel connection pebbling number pend(T perfect hash perfect matching permutation planar point types POSA problem proved pseudo-complement quasi-uniquely edge colorable result root routing from 7ra semi-heap sequence solution subgraph subsets subtree Suppose tolerance graphs Tower of Hanoi triangle type 60 type 7i points unblocked V(Ci vertices well-covered graphs well-covered tree