HYPERGRAPHS
From MaRDI portal
Publication:4068765
DOI10.1070/RM1974v029n06ABEH001303zbMath0311.05136MaRDI QIDQ4068765
Publication date: 1974
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Related Items (39)
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ On intersecting straight line systems ⋮ Signatures of extremal 2-unifrom hypergraphs ⋮ Heawood inequalities ⋮ Development of hypergraph theory ⋮ On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ Hypergraphs as algebraic structures ⋮ On problem of concrete characterization of universal automata ⋮ On epimorphisms of input symbol semigroups, of universal hypergraphic automata ⋮ The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs ⋮ Maximum spectral radius of outerplanar 3‐uniform hypergraphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees ⋮ On a relationship between the characteristic and matching polynomials of a uniform hypertree ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Maximum face-constrained coloring of plane graphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ On concrete characterization of universal hypergraphic automata ⋮ On transversal numbers of intersecting straight line systems and intersecting segment systems ⋮ Maximally edge-connected hypergraphs ⋮ On transversal and 2-packing numbers in uniform linear systems ⋮ Algorithm of multidimensional data transmission using extremal uniform hypergraphs ⋮ Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs ⋮ The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs ⋮ Coloring face hypergraphs on surfaces ⋮ Hypergraph recovery algorithms from a given vector of vertex degrees ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Representation of Planar Hypergraphs by Contacts of Triangles ⋮ Kuratowski-Pontrjagin theorem on planar graphs ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs ⋮ Edge-connectivity in hypergraphs ⋮ Unnamed Item ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Connectivity of Cartesian product of hypergraphs ⋮ Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ Semigroups characterizing hypergraphs
This page was built for publication: HYPERGRAPHS
