What people are saying - Write a review
We haven't found any reviews in the usual places.
a Survey M BEHZAD
Graphs with given Diameter and Maximal Valency and with a Minimal
J Some Unsolved Problems in Graph Theory and Combinatorial Analysis
10 other sections not shown
0-colouring 0-cycle algebra algorithm applications cardinality chromatic number chromatic polynomial coboundary colours combinatorial common transversal complete graph conjecture connected graph consider contains corresponding cycle defined dual edge-vectors elements equivalent Erdos example exists families of sets family of subsets finite set finite subsets given graph G graph theory Hamiltonian circuits Hence incidence algebra incidence matrix incident independence space inequality integer intersection isomorphic IU sets label lattice Lemma linear lines loop mapping Math matrix matroid maximal Menger's theorem minimal Mobius function n-connected necessary and sufficient nodes number of edges obtained optimal ordered set pair partially ordered set partition permutation planar planar graph plane points possible proof proved Rado rank function regular graph relations representable result sequence solution square BIBD subgraph theorem thrackle time-table problem transversal matroid tree upper bound valency vecset vertex vertices of G W. T. Tutte