scientific article
From MaRDI portal
Publication:3086230
zbMath1209.05002MaRDI QIDQ3086230
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items (25)
Structural conserved moiety splitting of a stoichiometric matrix ⋮ A remarkable connection betweenk-permutationsand colourings of Graphs ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ On the distance energy of \(k\)-uniform hypergraphs ⋮ Independence densities of hypergraphs ⋮ Attempting perfect hypergraphs ⋮ Subdivision of hypergraphs and their colorings ⋮ A pipeline for testing drug mechanism of action and combination therapies: from microarray data to simulations via linear-in-flux-expressions. Testing four-drug combinations for tuberculosis treatment ⋮ FIRST ZAGREB MATRIX AND ENERGY OF A T2 HYPERGRAPH ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The competition hypergraphs of doubly partial orders ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Super edge-magic labeling of \(m\)-node \(k\)-uniform hyperpaths and \(m\)-node \(k\)-uniform hypercycles ⋮ Robust similarity between hypergraphs based on valuations and mathematical morphology operators ⋮ INSTANTIAL NEIGHBOURHOOD LOGIC ⋮ A combinatorial approach to nonlocality and contextuality ⋮ On P-unique hypergraphs ⋮ ON c-SPACES AND HYPERGRAPHS ⋮ On the Laplacian spectrum of \(k\)-uniform hypergraphs ⋮ The Why, How, and When of Representations for Complex Systems ⋮ Finding the shortest path for a Hypergraph
This page was built for publication: