HYPERGRAPHS
From MaRDI portal
Publication:4068765
Cited in
(39)- Representation of Planar Hypergraphs by Contacts of Triangles
- On transversal numbers of intersecting straight line systems and intersecting segment systems
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Planar anti-Ramsey numbers of matchings
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- On problem of concrete characterization of universal automata
- Semigroups characterizing hypergraphs
- Edge-connectivity in hypergraphs
- Heawood inequalities
- On problem of finding all maximal induced bicliques of hypergraph
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Coloring face-hypergraphs of graphs on surfaces
- Hypergraphs as algebraic structures
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- Kuratowski-Pontrjagin theorem on planar graphs
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- Planar anti-Ramsey numbers of paths and cycles
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- Connectivity of Cartesian product of hypergraphs
- Signatures of extremal 2-unifrom hypergraphs
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
- Rank-width and tree-width of \(H\)-minor-free graphs
- Maximum face-constrained coloring of plane graphs
- On concrete characterization of universal hypergraphic automata
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Hypergraph recovery algorithms from a given vector of vertex degrees
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- Development of hypergraph theory
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Applying a hypergraph to determine the structure of some finite modules
- Coloring face hypergraphs on surfaces
- The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs
- Maximum spectral radius of outerplanar 3‐uniform hypergraphs
- Maximally edge-connected hypergraphs
- The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs
- On transversal and 2-packing numbers in uniform linear systems
- Representing graphs and hypergraphs by touching polygons in 3D
- On intersecting straight line systems
This page was built for publication: HYPERGRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068765)