Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The… Expand

Is this relevant?

2008

2008

The notion of strongly quotient graph was introduced by Adiga et al. (3). Here, we show that some well known families of graphs… Expand

Is this relevant?

2007

2007

In this paper we propose a dynamic programming algorithm to evaluate local similarity between ordered quotiented trees using a… Expand

Is this relevant?

2007

2007

A graph $G=(V,E)$ is a chordal probe graph if its vertices can be partitioned into two sets, $P$ (probes) and $N$ (non-probes… Expand

Is this relevant?

2005

2005

This paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric graphs, namely for graphs Γ admitting an… Expand

Is this relevant?

2000

2000

A predictive scanning input system provides predictive selection of individual indicators corresponding to keys on the keyboard… Expand

Is this relevant?

2000

2000

Let Γ be a finite G-symmetric graph whose vertex set admits a non-trivial Ginvariant partition B with block size v. A framework… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

An approximate minimum degree (AMD) ordering algorithm for preordering a symmetric sparse matrix prior to numerical factorization… Expand

Is this relevant?

1989

1989

Abstract Using a standard notion of a quotient graph of certain vertex-transitive graphs, methods for lifting a Hamilton cycle in… Expand

Is this relevant?

1986

1986

The partitioning of the vertices of an undirected graph, in a way that makes its quotient graph a tree, mirrors a way of… Expand

Is this relevant?