On edge perfectness and classes of bipartite graphs

DOI10.1016/0012-365X(94)00350-RzbMath0844.68095MaRDI QIDQ1910576

Haiko Müller

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite edge-perfect graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items (19)

Chromatic characterization of biclique covers ⋮ Computational aspects of the 2-dimension of partially ordered sets ⋮ An overview of graph covering and partitioning ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ On minimally non-firm binary matrices ⋮ Edge cover by connected bipartite subgraphs ⋮ Unnamed Item ⋮ ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Biclique-Helly graphs ⋮ Generating bicliques of a graph in lexicographic order ⋮ On the complete width and edge clique cover problems ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Covering Graphs with Few Complete Bipartite Subgraphs ⋮ Covering graphs with few complete bipartite subgraphs ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ Efficient approximation for restricted biclique cover problems

Cites Work

• Topics on perfect graphs
• Weakly triangulated graphs
• Characterizations of strongly chordal graphs
• Neighborhood perfect graphs
• Distance-hereditary graphs
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
• Bipartite permutation graphs
• Star-cutsets and perfect graphs
• Coloring graphs with stable cutsets
• Stable set bonding in perfect graphs and parity graphs
• Alternating cycle-free matchings
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• Normal hypergraphs and the perfect graph conjecture
• Covering, Packing and Generalized Perfection
• Ki-covers. II.Ki-perfect graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Node-Deletion Problems on Bipartite Graphs
• The NP-Completeness of Edge-Coloring
• Planar Formulae and Their Uses
• Line perfect graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On edge perfectness and classes of bipartite graphs