34 pages matching induced in this book
Results 1-3 of 34
What people are saying - Write a review
We haven't found any reviews in the usual places.
Edge Maximal Graphs with Large Bounded Degree
A Degree Condition for Hamiltonian Cycles in fTough
27 other sections not shown
1991 by Vishwa 2-connected adjacent Advances in Graph algorithm bind G binding number blocking probabilities bound channel graph chord chromatic number clique partition complete graph components condition connected block graph connected graph contradiction Conx(G Corollary cut vertex defined denote Department of Mathematics digraph Discrete Math disjoint edge-cutset eulerian graphs eulerian trail exists F-polynomials F.K. Hwang Figure G contains graph G graph of order Graph Theory Hamilton cycles hamiltonian cycles Hence hypergraph induced inequality integer isomorphic least Lemma Let G Let H m-edge-connected maximum matching minimum degree number of edges number of vertices obtained optimal digraph polynomial problems proper subgraph prove random hypertree Reconstruction Conjecture regular graph rotation number satisfies set of vertices SP-canopy subgraph H subgraph of G subset Suppose Theorem total dominating set tree V.R. Kulli vertex degree vertex set vertices of degree Vishwa International Publications voltage graph XP G