Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths

DOI10.1137/140981496zbMath1323.05096arXiv1406.6494OpenAlexW2963080050MaRDI QIDQ3195131

Anna Galluccio, Nicola Apollonio

Publication date: 21 October 2015

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

Full work available at URL: https://arxiv.org/abs/1406.6494

zbMATH Keywords

balanced/perfect graphbalanced/perfect matrices

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hypergraphs (05C65) Perfect graphs (05C17)

Related Items (1)

On some graph classes related to perfect graphs: a survey

Cites Work

• Testing balancedness and perfection of linear matrices
• The strong perfect graph theorem
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• Neighborhood perfect graphs
• Covering all cliques of a graph
• Properties of balanced and perfect matrices
• Structural properties and decomposition of linear balanced matrices
• Dyck path enumeration
• Decomposition of balanced matrices
• A new bijection between ordered trees and legal bracketings
• Algorithmic aspects of clique-transversal and clique-independent sets
• Distance-hereditary graphs are clique-perfect
• On balanced graphs
• Clique-perfectness and balancedness of some graph classes
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• Balanced matrices
• On minimal forbidden subgraph characterizations of balanced graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths