On minimal forbidden subgraph characterizations of balanced graphs

DOI10.1016/j.endm.2009.11.008zbMath1268.05135MaRDI QIDQ5891090

Guillermo Durán, Martín D. Safe, Flavia Bonomo-Braberman, Annegret K. Wagler

Publication date: 19 July 2013

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

Full work available at URL: http://hdl.handle.net/20.500.12110/paper_0166218X_v161_n13-14_p1925_Bonomo

zbMATH Keywords

line graphs; balanced graphs; perfect; \(P_{4}\)-tidy graphs; paw-free graphs; clique-vertex incidence matrix; balanced matrices; minimal forbidden induced subgraphs characterization

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Unnamed Item, Clique-perfectness and balancedness of some graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• The strong perfect graph theorem
• Motivations and history of some of my conjectures
• On certain polytopes associated with graphs
• Recognizing Berge graphs
• Normal hypergraphs and the perfect graph conjecture
• A polynomial recognition algorithm for balanced matrices
• On balanced graphs
• Line perfect graphs
• Balanced matrices