scientific article
From MaRDI portal
Publication:3575460
zbMath1196.05056MaRDI QIDQ3575460
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/103/showToc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
intersection graphchordal graphHelly propertyintersection numberedge clique graphmaximal cliqueunique representabilityfractional intersection numberdiamond-free elimination graphmaximal clique irreducible graphpurple graphST weighting algorithm
Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Edge-clique covers of the tensor product ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ Unique intersectability of diamond-free graphs ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ Recognizing edge clique graphs among interval graphs and probe interval graphs
This page was built for publication:
