On balanced graphs

DOI10.1007/S10107-005-0651-YMaRDI QIDQ2583124zbMATH OpenOpenAlexFDO

Authors Guillermo Durán, Min Chih Lin, Flavia Bonomo, Jayme L. Szwarcfiter

Publication date 13 January 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10533/177630

zbMATH Keywords

Algorithms0-1 matricesDominationClique graphsBalanced hypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Recommendations

• On minimal forbidden subgraph characterizations of balanced graphs
• On minimal forbidden subgraph characterizations of balanced graphs
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• A polynomial recognition algorithm for balanced matrices
• Balancedness of subclasses of circular-arc graphs

Cites work

• scientific article; zbMATH DE number 3427408 (Why is no real title available?)
• scientific article; zbMATH DE number 3168327 (Why is no real title available?)
• scientific article; zbMATH DE number 4199652 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• scientific article; zbMATH DE number 553916 (Why is no real title available?)
• scientific article; zbMATH DE number 1944140 (Why is no real title available?)
• scientific article; zbMATH DE number 1750103 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• scientific article; zbMATH DE number 3363617 (Why is no real title available?)
• A New Algorithm for Generating All the Maximal Independent Sets
• A partial characterization of clique graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Algorithmic aspects of clique-transversal and clique-independent sets
• Algorithmic graph theory and perfect graphs
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Balanced matrices
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Combinatorial optimization. Packing and covering
• Decomposition of balanced matrices
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• Neighborhood perfect graphs
• On certain polytopes associated with graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Über iterierte Clique-Graphen

Cited in

(31)

• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• Solution of three problems of Cornuéjols
• Graphs with the balas—uhry property
• Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
• Weighted maximum-clique transversal sets of graphs
• The clique-perfectness and clique-coloring of outer-planar graphs
• Clique-perfectness of claw-free planar graphs
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• scientific article; zbMATH DE number 5543097 (Why is no real title available?)
• scientific article; zbMATH DE number 7332479 (Why is no real title available?)
• Bounds on the clique-transversal number of regular graphs
• On minimal forbidden subgraph characterizations of balanced graphs
• A unified approach to recognize squares of split graphs
• On some graph classes related to perfect graphs: a survey
• Complete-subgraph-transversal-sets problem on bounded treewidth graphs
• Variations of maximum-clique transversal sets on graphs
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• Mengerian quasi-graphical families and clutters
• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
• CFI Construction and Balanced Graphs
• The clique-transversal set problem in claw-free graphs with degree at most 4
• Algorithms for finding clique-transversals of graphs
• Integrality properties of certain special balanceable families
• Balancedness of some subclasses of circular-arc graphs
• On minimal forbidden subgraph characterizations of balanced graphs
• The generalized independent set problem: polyhedral analysis and solution approaches
• Clique-perfectness and balancedness of some graph classes
• scientific article; zbMATH DE number 6302886 (Why is no real title available?)
• Every graph is contained in a sparsest possible balanced graph

This page was built for publication: On balanced graphs

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