The average size of ordered binary subgraphs

DOI10.1007/3-540-50728-0_55MaRDI QIDQ6199474FDOQ6199474

Authors: Pieter Hartel 

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ris.utwente.nl/ws/files/6145377/fulltext.pdf

Recommendations

• scientific article; zbMATH DE number 3849285
• Average size of simplified trees
• Subtrees of graphs
• scientific article; zbMATH DE number 1156488
• The average size of a connected vertex set of a graph—Explicit formulas and open problems

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• The Mechanical Evaluation of Expressions
• Evaluation of a class of binomial coefficient summations

This page was built for publication: The average size of ordered binary subgraphs

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