Enumeration of labelled multigraphs by degree parities

DOI10.1016/0012-365X(82)90058-9zbMath0496.05025OpenAlexW2054891628MaRDI QIDQ1170254

Robert W. Robinson, Ronald C. Read

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90058-9

zbMATH Keywords

generating functionlabelled graphsdegree paritieslabelled multigraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items

Enumeration of unlabelled bicolored graphs by degree parities, Enumeration of unlabelled graphs with specified degree parities, On oriented 2-factorable graphs, Combinatorial properties of a general domination problem with parity constraints, Parity dimension for graphs

Cites Work

• Unnamed Item
• Euler Graphs on Labelled Nodes
• The Number of Linear, Directed, Rooted, and Connected Graphs