Enumeration of unlabelled mating graphs

DOI10.1007/s00373-007-0692-5zbMath1116.05038OpenAlexW2074797470MaRDI QIDQ879945

Goran Kilibarda

Publication date: 10 May 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0692-5

zbMATH Keywords

Exact enumerationBijective proofUnlabelled graphs without endpointsUnlabelled mating graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Generating irreducible copositive matrices using the stable set problem ⋮ Enumeration of point-determining graphs ⋮ Exact-2-relation graphs

Uses Software

• nauty
• OEIS

Cites Work

• Enumeration of non-separable graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of unlabelled mating graphs