Enumerative aspects of certain subclasses of perfect graphs

DOI10.1016/S0012-365X(99)00022-9zbMath0936.05058WikidataQ128011541 ScholiaQ128011541MaRDI QIDQ1301836

Venkatesan Guruswami

Publication date: 26 April 2000

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

zbMATH Keywords

generating functionsYoung tableauxisomorphismperfect graphpermutation graphcographPolya's enumeration theoryoutput-restricted deque

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Enumeration in graph theory (05C30) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Unnamed Item ⋮ Enumeration of point-determining graphs ⋮ Some good characterization results relating to the Kőnig-Egerváry theorem ⋮ Connected permutation graphs ⋮ Enumerating threshold graphs and some related graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• Trivially perfect graphs
• Enumeration of difference graphs
• Threshold graphs and related topics
• Permutations, matrices, and generalized Young tableaux
• Normal hypergraphs and the perfect graph conjecture
• Longest Increasing and Decreasing Subsequences
• A Linear Recognition Algorithm for Cographs
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• A Note on "The Comparability Graph of a Tree"

This page was built for publication: Enumerative aspects of certain subclasses of perfect graphs