20 citations · 106 across the 85 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
Mark Korenblit, Vadim E. Levit
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a square rhomboid that is an example of non-series-parallel graphs. Our i…
cs.DM2012
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6
Vadim Levit, David Tankus
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if a…