Minimax relations for the partial q-colorings of a graph
Discrete Mathematics - Graph colouring and variations
Discrete Applied Mathematics - Combinatorial Optimization
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
Journal of the ACM (JACM)
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Combinatorica
A polynomial recognition algorithm for balanced matrices
Journal of Combinatorial Theory Series B
Faster recognition of clique-Helly and hereditary clique-Helly graphs
Information Processing Letters
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Claw-free graphs and two conjectures on omega, delta, and chi
Claw-free graphs and two conjectures on omega, delta, and chi
Hi-index | 0.04 |
A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.