Strong cliques and stable sets

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Strong cliques and stable sets
Authors:	ID Milanič, Martin (Author)
Files:	https://www.cambridge.org/core/books/topics-in-algorithmic-graph-theory/strong-cliques-and-stable-sets/2A48E760590D65F3BD1105C1540752A0
Language:	English
Work type:	Unknown
Typology:	1.16 - Independent Scientific Component Part or a Chapter in a Monograph
Organization:	IAM - Andrej Marušič Institute
Keywords:	strong clique, strong stable set, CIS graph, general partition graph, localizable graph
Year of publishing:	2021
Number of pages:	Str. 207-227
PID:	20.500.12556/RUP-16791
UDC:	519.17
DOI:	10.1017/9781108592376.013
COBISS.SI-ID:	70170883
Publication date in RUP:	16.07.2021
Views:	1054
Downloads:	33
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:	Topics in algorithmic graph theory
Editors:	Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson
Place of publishing:	Cambridge
Publisher:	Cambridge University Press
ISBN:	978-1-108-49260-7
COBISS.SI-ID:	69701123
Collection title:	Encyclopedia of mathematics and its applications
Collection numbering:	ǂvol. ǂ178

Language:	English
Keywords:	krepka klika, krepka neodvisna množica, CIS graf, splošen particijski graf, lokalizabilen graf

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back