Counting two-graphs related to trees

MaRDI QIDQ1344397zbMATHFDO

Authors Peter J. Cameron

Publication date 9 February 1995

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/118557

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

treesenumerationtwo-graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• Two-graphs and trees
• scientific article; zbMATH DE number 1984538
• scientific article; zbMATH DE number 125499
• scientific article; zbMATH DE number 4099342
• scientific article; zbMATH DE number 1735656

Cited in

(11)

• scientific article; zbMATH DE number 409493 (Why is no real title available?)
• Series expansion of the percolation threshold on hypercubic lattices
• The planar limit of \(\mathcal{N} = 2\) superconformal field theories
• On the Grundy number of Cameron graphs
• Stories about groups and sequences
• scientific article; zbMATH DE number 125499 (Why is no real title available?)
• scientific article; zbMATH DE number 3855139 (Why is no real title available?)
• Enumeration of \(P_4\)-free chordal graphs
• Counting labeled Greg cacti and clique trees
• The Perimeter of Proper Polycubes
• Enumeration of subtrees of planar two-tree networks

This page was built for publication: Counting two-graphs related to trees

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