Showing papers on "Quartic graph published in 1986"
TL;DR: It is shown that, given an arbitrary NLC grammar G generating the language L(G) of bounded degree, one can effectively compute the maximum integer which appears as the degree of a graph in L( G) .
21 citations
Proceedings Article•
01 Dec 198611 citations
01 Feb 1986
TL;DR: The procedure is to construct a set of graph models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function, which relies on a backtracking algorithm for numbering the vertices of the graph.
Abstract: A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this function relies on a backtracking algorithm for numbering the vertices of the graph. Careful selection of the graph model limits the time spent searching. Good results have been obtained for dictionaries of up to 181 words. Using the same techniques, non-minimal perfect has functions have been found for sets of up to 667 words.
10 citations
TL;DR: The condition of O. Ore [8] was generalised and proved that if G has no less than 1⁄2(n1 ) ( n 2 ) + 2 edges and if n = nl + n2 + " ' " + nk, G contains k independent cycles of lengths nx, n2, • • • , nk except in two cases.
10 citations
TL;DR: The Euler tour graph of an Eulerina graph by K -transformations is defined and it is proved that any edge in an Elerina graph is in a Hamilton cycle.
9 citations
8 citations
6 citations
TL;DR: It is shown that a 2-connected oriented graph of order n, with at least 1 2 n(n − 1) −2 arcs is Hamiltonian, and a related conjecture is given.
4 citations
TL;DR: In this paper, a class of plane multigraphs having a series-parallel structure is defined and enumerated, both for the rooted graphs as originally defined, and also for those where no distinctions are made between the vertices.
Abstract: A class of plane multigraphs having a series-parallel structure is defined and enumerated. The enumeration is carried out both for the rooted graphs as originally defined, and also for those where no distinctions are made between the vertices. Some other related problems are also discussed.
2 citations
01 Jan 1986
1 citations