What people are saying - Write a review
We haven't found any reviews in the usual places.
Some Results On Connected Resolvability in Graphs
Sorting and Cayley Graphs on Sn by A Gregory Starling
Ordered Whist Tournaments Existence Results by Stephanie Costa
9 other sections not shown
Other editions - View all
2-geodominated adjacent algorithm appendage number assume biclique biclique cover bipartite graph branch decomposition branchwidth Combinatorial complete graph component Computer CONGRESSUS NUMERANTIUM 159 connected graph connected resolving set contradiction Corollary corresponding cover and partition cycle defined denote digraph directed T-coloring distance similar equivalence exists extended tournament feedback arc set Figure follows G contains G x K2 given graph G Graph Theory hamiltonian laceable hamiltonian path heuristic homomorphism hyperedge hyperedge types hypergraph independence number induced subgraph integer interval coloring interval graph isomorphic latin square Lemma Let G lower bound Mathematics matrix minimum neighbors nodes number of vertices one-factors optimal paper partial domination graph permutation planar graphs probe interval graph problem Proof rad(H regular graph result set of G similar equivalence classes subset Suppose T-span tagged probe interval Theorem total chromatic tree triangles uniform central graph upper bound upset path upset tournament users vertex vertices of G