Zobrazeno 1 - 10
of 11
pro vyhledávání: '"MSC-05C75"'
Autor:
Helminck, G.F., Twilt, F.
Newton flows are dynamical systems generated by a continuous, desingularized Newton method for mappings from a Euclidean space to itself. We focus on the special case of meromorphic functions on the complex plane. Inspired by the analogy between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::cffcfd51f46999dba4b8eba7a378bc44
https://research.utwente.nl/en/publications/newton-flows-for-elliptic-functions(241703e1-9b42-4f1d-960a-e83c9c744a84).html
https://research.utwente.nl/en/publications/newton-flows-for-elliptic-functions(241703e1-9b42-4f1d-960a-e83c9c744a84).html
Publikováno v:
Graphs and combinatorics, 30(3), 743-753. Springer
We verify two special cases of Thomassen's conjecture of 1976 stating that every longest cycle in a 3-connected graph contains a chord.We prove that Thomassen's conjecture is true for two classes of 3-connected graphs that have a bounded number of re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a16f8e590d3000d52ddb031a3a02d3bc
https://research.utwente.nl/en/publications/ac6ddc9b-c54e-45a4-9587-ecacd51178de
https://research.utwente.nl/en/publications/ac6ddc9b-c54e-45a4-9587-ecacd51178de
Publikováno v:
Discrete applied mathematics, 155(1/2), 92-102. Elsevier
Discrete Applied Mathematics, 155(2), 92-102. Elsevier
Discrete Applied Mathematics, 155(2), 92-102. Elsevier
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecbda1cfa18dbdf8d3ad8db399c1150e
https://research.utwente.nl/en/publications/104921b0-be2d-42af-ad7e-116e24c02327
https://research.utwente.nl/en/publications/104921b0-be2d-42af-ad7e-116e24c02327
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b15b431c796ecc192934f114565cd957
Autor:
Bonsma, P.S.
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::cd18bcf9e7df674896b09a68f849d1d1
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html
The cycle on twelve points is a well-known representation of the twelve pitch classes of the traditional scale. We treat a more general situation where the number of pitch classes can be different from twelve and where, moreover, other measures of cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b02e9a66c1ce37dcde2d31ef6cac8469
Autor:
Althuis, T.A., Göbel, F.
The cycle on twelve points is a well-known representation of the twelve pitch classes of the traditional scale. We treat a more general situation where the number of pitch classes can be different from twelve and where, moreover, other measures of cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::ef4ec2555f04373b5d2cf4a4fd824378
https://research.utwente.nl/en/publications/graph-theoretic-aspects-of-music-theory(3a1eabe2-f277-47ef-bc7d-33c0941e6834).html
https://research.utwente.nl/en/publications/graph-theoretic-aspects-of-music-theory(3a1eabe2-f277-47ef-bc7d-33c0941e6834).html
Autor:
Keijsper, J.C.M., Tewes, M.
A $\beta$-perfect graph is a simple graph $G$ such that $\chi(G')=\beta(G')$ for every induced subgraph $G'$ of $G$, where $\chi(G')$ is the chromatic number of $G'$, and $\beta(G')$ is defined as the maximum over all induced subgraphs $H$ of $G'$ of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::08c26e9cade7157464efa546e9fd30bb
https://research.utwente.nl/en/publications/conditions-for-betaperfectness(1365452d-428c-42b4-a368-64efdc5a542a).html
https://research.utwente.nl/en/publications/conditions-for-betaperfectness(1365452d-428c-42b4-a368-64efdc5a542a).html
A $\beta$-perfect graph is a simple graph $G$ such that $\chi(G')=\beta(G')$ for every induced subgraph $G'$ of $G$, where $\chi(G')$ is the chromatic number of $G'$, and $\beta(G')$ is defined as the maximum over all induced subgraphs $H$ of $G'$ of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b81dfb1e387b1619014be0845314c69e
Publikováno v:
University of Twente Research Information (Pure Portal)
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::58a74086e7cbbc438229955642ca1ef2
https://research.utwente.nl/en/publications/isomorphisms-and-traversability-of-directed-path-graphs(9e0be645-4760-4049-87a1-c9c6bb6a2fe1).html
https://research.utwente.nl/en/publications/isomorphisms-and-traversability-of-directed-path-graphs(9e0be645-4760-4049-87a1-c9c6bb6a2fe1).html