Isomorph-free generation of 2-connected graphs with applications

Details Isomorph-free generation of 2-connected graphs with applications Isomorph-free generation of 2-connected graphs with applications

2011-04-27

arxiv.org/abs/1104.5261v1

Mathematics

Combinatorics

15 pages, 3 figures, 4 tables

Scientific paper

Many interesting graph families contain only 2-connected graphs, which have ear decompositions. We develop a technique to generate families of unlabeled 2-connected graphs using ear augmentations and apply this technique to two problems. In the first application, we search for uniquely K_r-saturated graphs and find the list of uniquely K_4-saturated graphs on at most 12 vertices, supporting current conjectures for this problem. In the second application, we verifying the Edge Reconstruction Conjecture for all 2-connected graphs on at most 12 vertices. This technique can be easily extended to more problems concerning 2-connected graphs.

Affiliated with

Also associated with

No associations

Rating

Isomorph-free generation of 2-connected graphs with applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Isomorph-free generation of 2-connected graphs with applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorph-free generation of 2-connected graphs with applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448736