Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Larry J. Langley"'
Publikováno v:
Order. 35:495-514
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned into k classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we study t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a086710db5dbba3882337269565babf
https://doi.org/10.1007/s11083-017-9445-0
https://doi.org/10.1007/s11083-017-9445-0
Publikováno v:
Discrete Mathematics. 226:35-50
We construct all six-element orders which are not 50%-tolerance orders. We show that a width-two order is a 50% tolerance order if and only if no restriction of the order to a six-element set is isomorphic to one of these six-element orders. This yie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97fac0fe794949c29a84a8cd284ec74a
https://doi.org/10.1016/s0012-365x(00)00124-2
https://doi.org/10.1016/s0012-365x(00)00124-2
Publikováno v:
Journal of Combinatorial Theory, Series B. 71(1):73-78
LetGbe a graph withnnodes,eedges, chromatic numberχ, and girthg. In an acyclic orientation ofG, an arc isdependentif its reversal creates a cycle. It is well known that ifχ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42a5081711d307df945c593f3a02bf84
Publikováno v:
Discrete Applied Mathematics. 60(1-3):99-117
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.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a2ed6553b9245237d27d22ff482e835
Autor:
Larry J. Langley
Publikováno v:
Discrete Applied Mathematics. 60:257-266
From a partially ordered set (X
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58697f5736218fa722cb9cc3eca40d7d
https://doi.org/10.1016/0166-218x(94)00056-j
https://doi.org/10.1016/0166-218x(94)00056-j
Autor:
David E. Brown, Larry J. Langley
Publikováno v:
Studies in Choice and Welfare ISBN: 9783540791270
The Mathematics of Preference, Choice and Order
The Mathematics of Preference, Choice and Order
A probe interval graph is a graph with vertex partition P ∪ N and to each vertex v there corresponds an interval Iv such that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices belongs to P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7d51bdf64d82bd6abf5643d99369f86
https://doi.org/10.1007/978-3-540-79128-7_18
https://doi.org/10.1007/978-3-540-79128-7_18
Autor:
Larry J. Langley, Kim A. S. Factor
Publikováno v:
Discussiones Mathematicae Graph Theory. 27:51
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::120dde801546b460e20b5b2c97db96f1
https://doi.org/10.7151/dmgt.1344
https://doi.org/10.7151/dmgt.1344
Autor:
Kim A. S. Factor, Larry J. Langley
Publikováno v:
Discrete Mathematics. (1):34-43
A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,v}@?E[dom(D)] whenever (u,z)@?A(D) or (v,z)@?A(D) for every other vertex [email protected]?V(D). The underlying graph of a digraph D, UG(D), is the graph for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2446be55253961bf56c9306c5a38acd