Counting two-graphs related to trees

zbMATH Open0810.05031MaRDI QIDQ1344397FDOQ1344397

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

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

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

zbMATH Keywords

treesenumerationtwo-graphs

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• On the Grundy number of Cameron graphs
• Enumeration of \(P_4\)-free chordal graphs
• The Perimeter of Proper Polycubes
• Enumeration of subtrees of planar two-tree networks
• The planar limit of \(\mathcal{N} = 2\) superconformal field theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Series expansion of the percolation threshold on hypercubic lattices
• Stories about groups and sequences

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)