✦ LIBER ✦

Counting the 10-point graphs by partition

✍ Scribed by R. C. Read; N. C. Wormald

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 694 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050208

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.

📜 SIMILAR VOLUMES

Counting canonical partitions in the ran

Counting canonical partitions in the random graph

✍ Jean A. Larson 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 551 KB

Covering the complete graph by partition

Covering the complete graph by partitions

✍ Zoltán Füredi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A (D, c)-coloring of the complete graph K" is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are

Dynamics of Nodal Points and the Nodal C

Dynamics of Nodal Points and the Nodal Count on a Family of Quantum Graphs

✍ Ram Band; Gregory Berkolaiko; Uzy Smilansky 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 795 KB

On the partition and coloring of a graph

On the partition and coloring of a graph by cliques

✍ W.D. Wallis; Guo-Hui Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques, Discrete Mathematics 120 (1993) 191-203. We first introduce the concept of the k-chromatic index of a graph, and then discuss some of its properties. A characterization of the clique partition number of the graph G V

Detection of Hopf points by counting sec

Detection of Hopf points by counting sectors in the complex plane

✍ W. Govaerts; A. Spence 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 147 KB

Level crossings and branch points studie

Level crossings and branch points studied by the multidimensional partitioning technique

✍ Erkki Brändas; Piotr Froelich 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

## Abstract The possibility of level crossings is discussed from a general multidimensional partitioning viewpoint. By extending the traditional motion of a self‐adjoint Hamiltonian to a self‐adjoint analytic family of operators, it is found that level intersections that appear fall into two mutual