Autor:	Larry J. Langley, Garth Isaak, Peter C. Fishburn, Kenneth P. Bogart
Rok vydání:	1995
Předmět:	Combinatorics Indifference graph Computer Science::Discrete Mathematics Chordal graph Trivially perfect graph Applied Mathematics Trapezoid graph Discrete Mathematics and Combinatorics Maximal independent set Unit (ring theory) MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Discrete Applied Mathematics. 60(1-3):99-117
ISSN:	0166-218X
DOI:	10.1016/0166-218x(94)00044-e
Popis:	We answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs that are not unit tolerance graphs. An infinite family of graphs that are minimal in this respect is specified.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a2ed6553b9245237d27d22ff482e835 Zobrazit plný text záznamu Full Text from ScienceDirect