scientific article; zbMATH DE number 6964020

zbMath1459.05241MaRDI QIDQ4691855

V. V. Lepin, Oleg Duginov

Publication date: 24 October 2018

Full work available at URL: http://mathnet.ru/eng/timb199

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum \(H\)-decompositions of graphs: edge-critical case
• Mod/Resc parsimony inference: theory and application
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• Minimum weight \(H\)-decompositions of graphs: the bipartite case
• Generating bicliques of a graph in lexicographic order
• More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures
• Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
• Consensus algorithms for the generation of all maximal bicliques
• A continuous characterization of the maximum-edge biclique problem
• A new proof of a theorem of Graham and Pollak
• On the decomposition of graphs into complete bipartite graphs
• Covering graphs with few complete bipartite subgraphs
• On covering graphs by complete bipartite subgraphs
• Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
• Decomposition of product graphs into complete bipartite subgraphs
• Biclique decompositions and Hermitian rank
• Bipartite dimensions and bipartite degrees of graphs
• On the coverings of graphs
• A weighted min-max relation for intervals
• Some improved bounds on the information rate of perfect secret sharing schemes
• A mathematical analysis of human leukocyte antigen serology
• Covering graphs: The covering problem solved
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Graph decomposition of slim graphs
• Alternating cycle-free matchings
• Arboricity and bipartite subgraph listing algorithms
• Packing graphs: The packing problem solved
• Efficient covering designs of the complete graph
• Inertia and biclique decompositions of joins of graphs
• The maximum edge biclique problem is NP-complete
• Finding maximum edge bicliques in convex bipartite graphs
• On some multigraph decomposition problems and their computational complexity
• Graph decompositions and secret sharing schemes
• On the existence of balanced bipartite designs. II
• Bicliques and eigenvalues
• On edge perfectness and classes of bipartite graphs
• Exact exponential-time algorithms for finding bicliques
• Chromatic characterization of biclique covers
• Bipartite coverings and the chromatic number
• Minimum \(H\)-decompositions of graphs
• Biclique-Helly graphs
• Multigraph decomposition into stars and into multistars
• Eigenvalues and partitionings of the edges of a graph
• An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
• On Bipartite and Multipartite Clique Problems
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• The NP-Completeness of Some Edge-Partition Problems
• On the decomposition ofkn into complete bipartite graphs
• Packing and Covering of the Complete Graph with 4-Cycles^*
• On complete subgraphs of different orders
• The biparticity of a graph
• Approximating Clique and Biclique Problems
• Minimal NFA Problems are Hard
• Communication Complexity
• Biclique graphs and biclique matrices
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
• On Independent Sets and Bicliques in Graphs
• Algorithm Theory - SWAT 2004
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• The Representation of a Graph by Set Intersections
• On the Addressing Problem for Loop Switching
• Algorithms and Computation
• On the generation of bicliques of a graph
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: