Search Results - "Kubicki, G."

Graph similarity and distance in graphs by Chartrand, G., Kubicki, G., Schultz, M.

“…(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image) For connected graphs G^sub 1^ and G^sub 2^ of order n and a one-to-one mapping ...,…”
Get full text

Attainable results in committee elections by Bock, H.-H., Day, W.H.E., Kubicka, E., Kubicki, G., McMorris, F.R.

“…The committee election problem is to choose from a finite set S of candidates a nonempty subset T of committee members as the consequence of an election in…”
Get full text

The asymptotic plurality rule for molecular sequences by Day, W.H.E., Kubicka, E., Kubicki, G., McMorris, F.R.

“…The asymptotic plurality rule, apl, is a consensus function which maps each profile P of length n (i.e., each sequence of n bases appearing at an aligned…”
Get full text

Global properties of graphs with local degree conditions by Kubicka, E, Kubicki, G, Oellermann, O. R

“…Let P be a graph property. A graph is locally P if the subgraph induced by the open neighbourhood of every vertex has property P. A graph has the Dirac…”
Get full text

Totally positive matrices and totally positive hypergraphs by Kubicki, Grzegorz, Lehel, Jenő, Morayne, Michał

“…A real matrix is totally positive if all its minors are nonnegative. In this paper, we characterize 0–1 matrices that can be transformed into totally positive…”
Get full text

An Asymptotic Ratio in the Complete Binary Tree by Kubicki, Grzegorz, Lehel, Jenő, Morayne, Michał

Get full text

Steiner intervals in graphs by Kubicka, Ewa, Kubicki, Grzegorz, Oellermann, Ortrud R.

“…Let G be a graph and u, v two vertices of G. Then the interval from u to v consists of all those vertices that lie on some shortest u — v path. Let S be a set…”
Get full text

Patch Colorings and Rigid Colorings of the Rational n-Space by Kubicki, Grzegorz, Lehel, Jenő, Morayne, Michał

“…We investigate k-colorings of the rational n-space, Qn, such that any two points at distance one get distinct colors. Two types of colorings are considered:…”
Get full text

Planar graphs and greatest common subgraphs by Kubicki, Grzegorz

Get full text

The agreement metric for labeled binary trees by Goddard, W, Kubicka, E, Kubicki, G, McMorris, F R

“…Let S be a set of n objects. A binary tree of S is a binary tree whose leaves are labeled without repetition from S. The operation of pruning a tree T is that…”
Get more information

An algorithm to find agreement subtrees by KUBICKA, E, KUBICKI, G, MCMORRIS, F. R

Get full text

Greatest common divisors and least common multiples of graphs by Chartrand, G., Holley, L., Kubicki, G., Schultz, M.

Get full text