On balanced graphs
From MaRDI portal
Publication:2583124
DOI10.1007/s10107-005-0651-yzbMath1080.05058MaRDI QIDQ2583124
Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter, Flavia Bonomo-Braberman
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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C17: Perfect graphs
Related Items
On minimal forbidden subgraph characterizations of balanced graphs, Weighted maximum-clique transversal sets of graphs, Algorithms for finding clique-transversals of graphs, Bounds on the clique-transversal number of regular graphs, Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs, Variations of maximum-clique transversal sets on graphs, Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs, Algorithms for clique-independent sets on subclasses of circular-arc graphs, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Characterizations of strongly chordal graphs
- Neighborhood perfect graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Decomposition of balanced matrices
- Algorithmic graph theory and perfect graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Über iterierte Clique-Graphen
- Combinatorial Optimization
- Characterizations of totally balanced matrices
- A New Algorithm for Generating All the Maximal Independent Sets
- A partial characterization of clique graphs
- Balanced matrices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
