On related edges in well-covered graphs without cycles of length 4 and 6

Vadim E. Levit; David Tankus

doi:10.1007/978-3-642-02029-2_14

On related edges in well-covered graphs without cycles of length 4 and 6

Vadim E. Levit, David Tankus

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.

Original language	English
Title of host publication	Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday
Editors	Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell
Pages	144-147
Number of pages	4
DOIs	https://doi.org/10.1007/978-3-642-02029-2_14
State	Published - 2009
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5420 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-642-02029-2_14

Cite this

Levit, V. E., & Tankus, D. (2009). On related edges in well-covered graphs without cycles of length 4 and 6. In M. Lipshteyn, V. E. Levit, & R. M. McConnell (Eds.), Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (pp. 144-147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5420 LNCS). https://doi.org/10.1007/978-3-642-02029-2_14

Levit, Vadim E. ; Tankus, David. / On related edges in well-covered graphs without cycles of length 4 and 6. Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. editor / Marina Lipshteyn ; Vadim E. Levit ; Ross M. McConnell. 2009. pp. 144-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{515c78df5380497abcd534a7b8093b69,

title = "On related edges in well-covered graphs without cycles of length 4 and 6",

abstract = "A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.",

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

year = "2009",

doi = "10.1007/978-3-642-02029-2_14",

language = "אנגלית",

isbn = "3642020283",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "144--147",

editor = "Marina Lipshteyn and Levit, {Vadim E.} and McConnell, {Ross M.}",

booktitle = "Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday",

}

Levit, VE & Tankus, D 2009, On related edges in well-covered graphs without cycles of length 4 and 6. in M Lipshteyn, VE Levit & RM McConnell (eds), Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5420 LNCS, pp. 144-147. https://doi.org/10.1007/978-3-642-02029-2_14

On related edges in well-covered graphs without cycles of length 4 and 6. / Levit, Vadim E.; Tankus, David.
Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. ed. / Marina Lipshteyn; Vadim E. Levit; Ross M. McConnell. 2009. p. 144-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5420 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On related edges in well-covered graphs without cycles of length 4 and 6

AU - Levit, Vadim E.

AU - Tankus, David

PY - 2009

Y1 - 2009

N2 - A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.

AB - A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.

UR - http://www.scopus.com/inward/record.url?scp=70249120382&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02029-2_14

DO - 10.1007/978-3-642-02029-2_14

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70249120382

SN - 3642020283

SN - 9783642020285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 144

EP - 147

BT - Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday

A2 - Lipshteyn, Marina

A2 - Levit, Vadim E.

A2 - McConnell, Ross M.

ER -

Levit VE, Tankus D. On related edges in well-covered graphs without cycles of length 4 and 6. In Lipshteyn M, Levit VE, McConnell RM, editors, Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. 2009. p. 144-147. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-02029-2_14

On related edges in well-covered graphs without cycles of length 4 and 6

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this