On minimal forbidden subgraph characterizations of balanced graphs
DOI10.1016/J.DAM.2013.04.001zbMATH Open1286.05105OpenAlexW2180198633MaRDI QIDQ5920323FDOQ5920323
Authors: Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler 
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.001
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76) Perfect graphs (05C17)
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- Depth-First Search and Linear Graph Algorithms
- Modular decomposition and transitive orientation
- On certain polytopes associated with graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A New Algorithm for Generating All the Maximal Independent Sets
- The strong perfect graph theorem
- Trivially perfect graphs
- Recognizing Berge graphs
- The Complexity of the Partial Order Dimension Problem
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On balanced graphs
- Balanced matrices
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Title not available (Why is that?)
- Difference graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Topics on perfect graphs
- Line perfect graphs
- Title not available (Why is that?)
- Minimax relations for the partial q-colorings of a graph
- A polynomial recognition algorithm for balanced matrices
Cited In (8)
- Title not available (Why is that?)
- Solution of three problems of Cornuéjols
- On minimal forbidden subgraph characterizations of balanced graphs
- Balancedness of subclasses of circular-arc graphs
- Balancedness of some subclasses of circular-arc graphs
- Clique-perfectness and balancedness of some graph classes
- On balanced graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
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 Q5920323)
