1 citations · 1 across the 7 of their papers we have counts for
11 papers
Recognizing Relating Edges in Graphs without Cycles of Length 6
Vadim E. Levit, David Tankus
A graph is well-covered if all maximal independent sets are of the same cardinality. Let be a weight function. Then is -well-covered i…
Recognizing Graphs
Vadim E. Levit, David Tankus
Let be a graph. A set is independent if its elements are pairwise non-adjacent. A vertex is shedding if for every independent set $S \subseteq V…
Recognizing generating subgraphs revisited
Vadim E. Levit, David Tankus
A graph is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function is defined on its vertices. Then is -well-cove…
Generating subgraphs in chordal graphs
Vadim E. Levit, David Tankus
A graph is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function is defined on its vertices. Then is -well-cove…
Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7
David Tankus
Let be an induced complete bipartite subgraph of on vertex sets of bipartition and . The subgraph is {\it generating} if there exists an independent set…
Well-dominated graphs without cycles of lengths 4 and 5
Vadim E. Levit, David Tankus
Let be a graph. A set of vertices in dominates the graph if every vertex of is either in or a neighbor of a vertex in . Finding a minimal cardinality set whi…