Bipartite dimensions and bipartite degrees of graphs

DOI10.1016/0012-365X(95)00154-OzbMath0861.05035OpenAlexW1994836458MaRDI QIDQ1126290

Peter L. Hammer, Peter C. Fishburn

Publication date: 4 May 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00154-o

zbMATH Keywords

coverforbidden graphsbipartite degreebipartite dimensionBoolean interval dimension

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (25)

The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ 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 ⋮ Bipartite dimensions and bipartite degrees of graphs ⋮ Bi-objective optimization of biclustering with binary data ⋮ Biclique covers and partitions ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Three ways to cover a graph ⋮ Local and union boxicity ⋮ Erdős-Pyber theorem for hypergraphs and secret sharing ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ On the decomposition of graphs into complete bipartite graphs ⋮ Transversals of Latin squares and covering radius of sets of permutations ⋮ Factoring a band matrix over a semiring ⋮ Covering graphs with few complete bipartite subgraphs ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ The biclique covering number of grids ⋮ The Local Queue Number of Graphs with Bounded Treewidth ⋮ A linear programming formulation for the maximum complete multipartite subgraph problem ⋮ Determination of the star valency of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing intersection classes of graphs
• Bipartite dimensions and bipartite degrees of graphs
• Bounds for the covering number of a graph
• Betweenness, orders and interval graphs
• Quasimonotone Boolean Functions and Bistellar Graphs

This page was built for publication: Bipartite dimensions and bipartite degrees of graphs