Enumeration of unlabelled mating graphs

DOI10.1007/S00373-007-0692-5zbMATH Open1116.05038OpenAlexW2074797470MaRDI QIDQ879945FDOQ879945

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)

Cites Work

• Title not available (Why is that?)
• The On-Line Encyclopedia of Integer Sequences
• Enumeration of non-separable graphs

Cited In (5)

• Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
• \(k\)-Combinations of an unlabelled graph
• Enumeration of point-determining graphs
• Exact-2-relation graphs
• Generating irreducible copositive matrices using the stable set problem

Uses Software

• nauty
• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879945)