Partition coefficients of acyclic graphs

DOI10.1007/3-540-60618-1_85OpenAlexW1497056239MaRDI QIDQ6122234

John L. Pfaltz

Publication date: 28 February 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_85

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids and antimatroids - a survey
• Greedoids
• The theory of convex geometries
• Meet-distributive lattices and the anti-exchange closure
• Partition numbers for trees and ordered sets
• New results from an algorithm for counting posets
• On the poset of all posets on \(n\) elements
• A study of eigenspaces of graphs
• Convexity in directed graphs
• Convexity in Graphs and Hypergraphs
• Chromatic Polynomials

This page was built for publication: Partition coefficients of acyclic graphs