AbstractConsider N points labelled cyclically forming the vertex set of a planar convex polygon, pairs of which may be connected by bonds. Define a ladder graph to be a graph with no crossing bonds. New simple proofs are given for two results of Kirkman relating to the total number of ladder graphs with A bonds. Relations are derived for calculating the number of connected ladder graphs with A bonds, and asymptotic expressions are obtained
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
AbstractConsider N points labelled cyclically forming the vertex set of a planar convex polygon, pai...
A tree in a graph is a subgraph that is connected and has no cycles. A spanning tree in a graph is a...
AbstractMethods are developed for finding the number of unlabeled bridgeless or 2-line-connected gra...
The Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which enables ...
The Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which enables ...
AbstractRecurrence relations and generating functions for the tree polynomials of ladders are derive...
This paper is a contribution to the problem of counting geometric graphs on point sets. More concret...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractWe refine an identity between the numbers of certain non-crossing graphs and multigraphs, by...
AbstractThe Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which ...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
AbstractConsider N points labelled cyclically forming the vertex set of a planar convex polygon, pai...
A tree in a graph is a subgraph that is connected and has no cycles. A spanning tree in a graph is a...
AbstractMethods are developed for finding the number of unlabeled bridgeless or 2-line-connected gra...
The Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which enables ...
The Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which enables ...
AbstractRecurrence relations and generating functions for the tree polynomials of ladders are derive...
This paper is a contribution to the problem of counting geometric graphs on point sets. More concret...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractWe refine an identity between the numbers of certain non-crossing graphs and multigraphs, by...
AbstractThe Möbius ladder, Mn, is a simple cubic graph on 2n vertices. We present a technique which ...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two...
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifyi...
DOI
Add to ORKG