scientific article; zbMATH DE number 3606484
From MaRDI portal
Publication:4172077
zbMath0391.05028MaRDI QIDQ4172077
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GraphsHypergraphsBalanced HypergraphsBipartite GraphBirkhoff-Von Neumann TheoremBistochastic MatricesMulticolourings
Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)
Related Items (49)
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS ⋮ Two-component random utilities ⋮ Spanning trees in random regular uniform hypergraphs ⋮ The product property of the almost fixed point property for digital spaces ⋮ Minimizing and maximizing the diameter in orientations of graphs ⋮ The extremal spectral radii of \(k\)-uniform supertrees ⋮ Maximizing spectral radii of uniform hypergraphs with few edges ⋮ A Generalisation of the Matroid Lift Construction ⋮ Maps on random hypergraphs and random simplicial complexes ⋮ Blocking for external graph searching ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ Digital products with \(PN_k\)-adjacencies and the almost fixed point property in \(DTC_k^\blacktriangle\) ⋮ Local controllability of quantum systems ⋮ Subdivision of hypergraphs and their colorings ⋮ Structural learning about directed acyclic graphs from multiple databases ⋮ Relations, coverings, hypergraphs and matroids ⋮ On the online track assignment problem ⋮ Digital shy maps ⋮ Tournaments and generalized Young tableaux ⋮ On least distance eigenvalue of uniform hypergraphs ⋮ The complexity of recognizing linear systems with certain integrality properties ⋮ Parallel algorithms for connectivity problems in graph theory ⋮ Spectral hypergraph theory of the adjacency hypermatrix and matroids ⋮ The number of spanning trees in self-similar graphs ⋮ Alternate product adjacencies in digital topology ⋮ A geometric theory of hypergraph colouring ⋮ Compatible adjacency relations for digital products ⋮ A small set in a large parallelepiped. ⋮ Parallel breadth-first search algorithms for trees and graphs ⋮ Finding Hamiltonian circuits in quasi-adjoint graphs ⋮ Digital Lusternik-Schnirelmann category of digital functions ⋮ On subdirectly irreducible OMAs ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Structural questions with GERT-networks ⋮ Woven convolutional graph codes with large free distances ⋮ Remarks on Fixed Point Assertions in Digital Topology ⋮ Cartesian product of the universal covering property ⋮ Algorithms on Subtree Filament Graphs ⋮ Directed random graphs with given degree distributions ⋮ Digital homotopic distance between digital functions ⋮ Strict Sign-Central Matrices ⋮ A note on dimension and gaps in digital geometry ⋮ Small orthomodular partial algebras. ⋮ Colouring Some Classes of Perfect Graphs Robustly ⋮ Digital co-Hopf spaces ⋮ Fixed point sets in digital topology, 1 ⋮ Fixed Point Sets in Digital Topology, 2 ⋮ Entropy splitting for antiblocking corners and perfect graphs ⋮ The embedded homology of hypergraph pairs
This page was built for publication:
