On Almost Well-Covered Graphs of Girth at Least 6

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	On Almost Well-Covered Graphs of Girth at Least 6
Authors:	ID Ekim, Tinaz (Author) ID Gozüpek, Didem (Author) ID Hujdurović, Ademir (Author) ID Milanič, Martin (Author)
Files:	https://dmtcs.episciences.org/paper/view/id/4982
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	maximal independent set, almost well-covered graph, independence gap, girth
Year of publishing:	2018
Number of pages:	str. 1-15
Numbering:	#Vol. #20, #no. #2
PID:	20.500.12556/RUP-10014
UDC:	519.17
ISSN on article:	1365-8050
COBISS.SI-ID:	1540859332
Publication date in RUP:	06.12.2018
Views:	2524
Downloads:	62
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Discrete mathematics and theoretical computer science
Shortened title:	Discret. math. theor. comput. sci.
Publisher:	Assoc. Discrete Math. Theor. Comput. Sci.
ISSN:	1365-8050
COBISS.SI-ID:	8089433

Language:	English
Keywords:	maksimalna neodvisna množica, skoraj dobro pokrit graf, neodvisnostni primanjkljaj, ožina

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back