Detecting strong cliques

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Detecting strong cliques
Authors:	ID Hujdurović, Ademir (Author) ID Milanič, Martin (Author) ID Ries, Bernard (Author)
Files:	https://www.sciencedirect.com/science/article/abs/pii/S0012365X19302067?via%3Dihub
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	strong clique, weakly chordal graph, line graph, cubic graph
Year of publishing:	2019
Number of pages:	str. 2738-2750
Numbering:	#Vol. #342, #iss. #9
PID:	20.500.12556/RUP-11775
UDC:	519.17
ISSN on article:	0012-365X
DOI:	10.1016/j.disc.2019.06.010
COBISS.SI-ID:	1541365956
Publication date in RUP:	30.06.2019
Views:	3164
Downloads:	211
Metadata:
:	HUJDUROVIĆ, Ademir, MILANIČ, Martin and RIES, Bernard, 2019, Detecting strong cliques. Discrete Mathematics [online]. 2019. Vol. 342, no. 9, p. 2738–2750. [Accessed 6 April 2025]. DOI 10.1016/j.disc.2019.06.010. Retrieved from: https://www.sciencedirect.com/science/article/abs/pii/S0012365X19302067?via%3Dihub 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:	krepka klika, šibko tetiven graf, graf povezav, kubični graf

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back