𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with two isomorphism classes of spanning unicyclic subgraphs

✍ Scribed by Preben Dahl Vestergaard

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
345 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spanning subgraphs of graphs partitioned
Spanning subgraphs of graphs partitioned into two isomorphic pieces
✍ Anthony Bonato πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract A graph has the neighbor‐closed‐co‐neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed non‐neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

Chromatic classes of 2-connected (n, n +
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
✍ K.M. Koh; K.L. Teo πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 820 KB

Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G-H, if P( G) = P( H). A graph G is chromatically unique if G z H for any graph H such that H-G. Let J? denote the class of 2-connected graphs with n vertices and n+3 edges which contain a