Counting irregular multigraphs

DOI10.1016/S0012-365X(98)00190-3MaRDI QIDQ1296986zbMATH OpenOpenAlexFDO

Authors Aron C. Atkins, Gábor N. Sárközy, Stanley Selkow

Publication date 27 February 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00190-3

zbMATH Keywords

irregular multigraph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4148119
• The number of independent sets in an irregular graph
• On the number of irregular assignments on a graph
• Publication:4489188
• Counting matchings in irregular bipartite graphs and random lifts
• On the total irredundance number of non-regular graphs
• Counting over non-planar graphs
• Approximate counting of regular hypergraphs
• Counting matchings in graphs
• On the irregular chromatic number of a graph

Cites work

• Asymptotic enumeration by degree sequence of graphs of high degree

This page was built for publication: Counting irregular multigraphs

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