Complexity results on w-well-covered graphs.

Vadim E. Levit; David Tankus

Complexity results on w-well-covered graphs.

Department of Mathematics

Research output: Working paper › Preprint

Original language	English
Volume	abs/1401.0294
State	Published - 2014

Publication series

Name	CoRR

Access to Document

Cite this

@techreport{e015ec881fce4f71a62c6cb9d966d4d1,

title = "Complexity results on w-well-covered graphs.",

author = "Levit, {Vadim E.} and David Tankus",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2014",

language = "אנגלית",

volume = "abs/1401.0294",

series = "CoRR",

type = "WorkingPaper",

}

TY - UNPB

T1 - Complexity results on w-well-covered graphs.

AU - Levit, Vadim E.

AU - Tankus, David

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2014

Y1 - 2014

M3 - פרסום מוקדם

VL - abs/1401.0294

T3 - CoRR

BT - Complexity results on w-well-covered graphs.

ER -