On minimal forbidden subgraph characterizations of balanced graphs

DOI10.1016/J.ENDM.2009.11.008zbMATH Open1268.05135OpenAlexW2154967733MaRDI QIDQ5891090FDOQ5891090

Authors: Guillermo Durán, Martín D. Safe, Flavia Bonomo, 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

Recommendations

• On minimal forbidden subgraph characterizations of balanced graphs
• On balanced graphs
• scientific article; zbMATH DE number 30950
• Balanced matrices
• Recognizing balanceable matrices

zbMATH Keywords

balanced graphsline graphsperfect\(P_{4}\)-tidy graphspaw-free graphsclique-vertex incidence matrixbalanced matricesminimal forbidden induced subgraphs characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Balancedness of some subclasses of circular-arc graphs
• Clique-perfectness and balancedness of some graph classes
• On balanced graphs

This page was built for publication: On minimal forbidden subgraph characterizations of balanced graphs

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