On graphs admitting two disjoint maximum independent sets.

Zakir Deniz; Vadim E. Levit; Eugen Mandrescu

On graphs admitting two disjoint maximum independent sets.

Zakir Deniz, Vadim E. Levit, Eugen Mandrescu

Department of Mathematics

Research output: Working paper › Preprint

Original language	English
Volume	abs/1807.06914
State	Published - 2018

Publication series

Name	CoRR

Access to Document

Cite this

@techreport{833261d9426f4f049e9211299d459325,

title = "On graphs admitting two disjoint maximum independent sets.",

author = "Zakir Deniz and Levit, {Vadim E.} and Eugen Mandrescu",

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 = "2018",

language = "אנגלית",

volume = "abs/1807.06914",

series = "CoRR",

type = "WorkingPaper",

}

TY - UNPB

T1 - On graphs admitting two disjoint maximum independent sets.

AU - Deniz, Zakir

AU - Levit, Vadim E.

AU - Mandrescu, Eugen

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 - 2018

Y1 - 2018

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

VL - abs/1807.06914

T3 - CoRR

BT - On graphs admitting two disjoint maximum independent sets.

ER -