Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Benson Joeris"'
Publikováno v:
Discrete Applied Mathematics. 158:779-799
In the early 1980s, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee460303bb63ca8c895391d374fe52a0
https://doi.org/10.1016/j.dam.2009.10.008
https://doi.org/10.1016/j.dam.2009.10.008
Publikováno v:
Algorithmica. 59:215-239
A circular-arc model M is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then · is a Helly circular-arc model. A (Helly) circular-arc graph is the intersection graph of a (Helly) circular-arc model. Circular-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82754e355ab6f29ce07ad17586abccc4
https://doi.org/10.1007/s00453-009-9304-5
https://doi.org/10.1007/s00453-009-9304-5
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. Given a digraph G, a partially complemented digraph G ź is a digraph obtained from G by performing a sequence of vertex co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4570c2ec81dcf58438513be04a90c4c5
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783540483816
WG
WG
Ma and Spinrad have shown that every transitive orientation of a chordal comparability graph is the intersection of four linear orders. That is, chordal comparability graphs are comparability graphs of posets of dimension four. Among other uses, this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d62f348716bfa9764085f9bd83ae4507
https://doi.org/10.1007/11917496_16
https://doi.org/10.1007/11917496_16