On balanced graphs
From MaRDI portal
Publication:2583124
DOI10.1007/S10107-005-0651-YzbMATH Open1080.05058OpenAlexW2036195668MaRDI QIDQ2583124FDOQ2583124
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)
Cites Work
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Algorithmic graph theory and perfect graphs
- Über iterierte Clique-Graphen
- A New Algorithm for Generating All the Maximal Independent Sets
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Combinatorial optimization. Packing and covering
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of balanced matrices
- Title not available (Why is that?)
- A partial characterization of clique graphs
- Title not available (Why is that?)
- Balanced matrices
- Algorithmic aspects of clique-transversal and clique-independent sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neighborhood perfect graphs
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- Title not available (Why is that?)
Cited In (31)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
- Solution of three problems of Cornuéjols
- Graphs with the balas—uhry property
- Weighted maximum-clique transversal sets of graphs
- The clique-perfectness and clique-coloring of outer-planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clique-perfectness of claw-free planar graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- 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
- CFI Construction and Balanced Graphs
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Integrality properties of certain special balanceable families
- Algorithms for finding clique-transversals of graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Balancedness of some subclasses of circular-arc graphs
- Title not available (Why is that?)
- Clique-perfectness and balancedness of some graph classes
- The generalized independent set problem: polyhedral analysis and solution approaches
- Every graph is contained in a sparsest possible balanced graph
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
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)
