On two extensions of equimatchable graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	On two extensions of equimatchable graphs
Authors:	ID Deniz, Zakir (Author) ID Ekim, Tinaz (Author) ID Hartinger, Tatiana Romina (Author) ID Milanič, Martin (Author) ID Shalom, Mordechai (Author)
Files:	http://dx.doi.org/10.1016/j.disopt.2017.08.002
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexity
Year of publishing:	2017
Number of pages:	str. 112-130
Numbering:	#Vol. #26
PID:	20.500.12556/RUP-9454
UDC:	519.17
ISSN on article:	1572-5286
DOI:	10.1016/j.disopt.2017.08.002
COBISS.SI-ID:	1540044996
Publication date in RUP:	29.01.2018
Views:	2941
Downloads:	149
Metadata:
:	DENIZ, Zakir, EKIM, Tinaz, HARTINGER, Tatiana Romina, MILANIČ, Martin and SHALOM, Mordechai, 2017, On two extensions of equimatchable graphs. Discrete optimization [online]. 2017. Vol. 26, p. 112–130. [Accessed 6 April 2025]. DOI 10.1016/j.disopt.2017.08.002. Retrieved from: http://dx.doi.org/10.1016/j.disopt.2017.08.002 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

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

Language:	English
Keywords:	najmanjše maksimalno prirejanje, graf enako velikih maksimalnih prirejanj, povezavno dominantna množica, Gallai-Edmondsova dekompozicija, parameterizirana računska zahtevnost

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back