HYPERGRAPHS
From MaRDI portal
Cited in
(43)- Planar anti-Ramsey numbers of matchings
- On problem of concrete characterization of universal automata
- The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs
- On concrete characterization of universal hypergraphic automata
- Edge-connectivity in hypergraphs
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Hypergraph recovery algorithms from a given vector of vertex degrees
- Heawood inequalities
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Coloring face hypergraphs on surfaces
- The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs
- On transversal numbers of intersecting straight line systems and intersecting segment systems
- Planar anti-Ramsey numbers of paths and cycles
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Representation of Planar Hypergraphs by Contacts of Triangles
- On problem of finding all maximal induced bicliques of hypergraph
- Hypergraphs as algebraic structures
- Signatures of extremal 2-unifrom hypergraphs
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- Coloring face-hypergraphs of graphs on surfaces
- Rank-width and tree-width of \(H\)-minor-free graphs
- Representing graphs and hypergraphs by touching polygons in 3D
- Connectivity of Cartesian product of hypergraphs
- Maximum face-constrained coloring of plane graphs
- Maximum spectral radius of outerplanar 3‐uniform hypergraphs
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- Almost-consistent families of marginals of dichotomic stochastic variables on large finite-connectivity random graphs
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- On transversal and 2-packing numbers in uniform linear systems
- A fast algorithm for computing a planar support for non-piercing rectangles
- Maximally edge-connected hypergraphs
- Semigroups characterizing hypergraphs
- On intersecting straight line systems
- Applying a hypergraph to determine the structure of some finite modules
- Development of hypergraph theory
- Conformality of minimal transversals of maximal cliques
- Kuratowski-Pontrjagin theorem on planar graphs
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
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)