Enumeration of difference graphs

DOI10.1016/0166-218X(94)00061-HzbMath0833.05046MaRDI QIDQ1894373

Feng Sun, Uri N. Peled

Publication date: 24 July 1995

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

zbMATH Keywords

bipartite graphStirling numbersenumerationsbipartitionneighborhoodsdifference graph

Mathematics Subject Classification ID

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

Related Items (3)

On the OBDD representation of some graph classes ⋮ Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs ⋮ Enumerative aspects of certain subclasses of perfect graphs

Cites Work

• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• The Complexity of the Partial Order Dimension Problem
• Difference graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of difference graphs