On economical set representations of graphs

zbMATH Open1196.05056MaRDI QIDQ3575460FDOQ3575460

Authors: Jing Kong, Yaokun Wu 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/103/showToc.html

Recommendations

• Completeness for intersection classes
• Characterizing intersection classes of graphs
• An efficient representation of chordal graphs
• Intersection representation of a chordal graph by subtrees of a spanning tree
• Graphs of small dimensions

zbMATH Keywords

Helly propertyintersection graphintersection numberchordal graphmaximal cliqueunique representabilityfractional intersection numberdiamond-free elimination graphedge clique graphmaximal clique irreducible graphpurple graphST weighting algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (8)

• Unique intersectability of diamond-free graphs
• Recognizing edge clique graphs among interval graphs and probe interval graphs
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• Irreducible economies and strongly connected graphs
• Computing square roots of trivially perfect and threshold graphs
• Edge-clique covers of the tensor product
• Set intersection representations for almost all graphs
• Completeness for intersection classes

This page was built for publication: On economical set representations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575460)