The following pages link to HYPERGRAPHS (Q4068765):
Displayed 39 items.
- Hypergraphs as algebraic structures (Q353693) (← links)
- Maximally edge-connected hypergraphs (Q501024) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices (Q786168) (← links)
- Semigroups characterizing hypergraphs (Q1066164) (← links)
- Heawood inequalities (Q1092918) (← links)
- Kuratowski-Pontrjagin theorem on planar graphs (Q1248630) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Development of hypergraph theory (Q1647456) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs (Q1995391) (← links)
- Recursion relations for chromatic coefficients for graphs and hypergraphs (Q2062676) (← links)
- Edge-connectivity in hypergraphs (Q2065350) (← links)
- Connectivity of Cartesian product of hypergraphs (Q2079817) (← links)
- Signatures of extremal 2-unifrom hypergraphs (Q2134319) (← links)
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata (Q2172882) (← links)
- The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs (Q2185443) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- On transversal numbers of intersecting straight line systems and intersecting segment systems (Q2236577) (← links)
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs (Q2258883) (← links)
- Hypergraph recovery algorithms from a given vector of vertex degrees (Q2263922) (← links)
- Planar anti-Ramsey numbers of paths and cycles (Q2324510) (← links)
- Sufficient conditions for hypergraphs to be maximally edge-connected (Q2335157) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- On problem of concrete characterization of universal automata (Q2404807) (← links)
- Planar anti-Ramsey numbers of matchings (Q2421877) (← links)
- On concrete characterization of universal hypergraphic automata (Q2452663) (← links)
- Applying a hypergraph to determine the structure of some finite modules (Q2700117) (← links)
- On intersecting straight line systems (Q5043952) (← links)
- On Problem of Finding all Maximal Induced Bicliques of Hypergraph (Q5071398) (← links)
- On transversal and 2-packing numbers in uniform linear systems (Q5154597) (← links)
- The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs (Q5424070) (← links)
- Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)
- (Q5708606) (← links)
- Maximum spectral radius of outerplanar 3‐uniform hypergraphs (Q6081881) (← links)
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees (Q6137205) (← links)
- On a relationship between the characteristic and matching polynomials of a uniform hypertree (Q6204332) (← links)