Showing 1 - 20 results of 21 for search 'Graph theory' Narrow Search
Search Tools: Email this Search — Save search to account
11
Dissertation/ Thesis
Some counting problems in graphs

Authors: Mohr, Elena

Contributors: Rautenbach, Dieter, Bruhn-Fujimoto, Henning

Subject Terms: Hamiltonian cycles, Independence number, Domination number, Rainbow triangles, DDC 510 / Mathematics, Graph theory, Counting, Hamiltonian systems, Graphentheorie, Dominanzzahl, Rechnen, Hamiltonscher Graph

File Description: application/pdf

Relation: J. D. Alvarado, S. Dantas, E. Mohr, and D. Rautenbach. “On the maximum number of minimum dominating sets in forests”. In: Discrete Mathematics 342.4 (2019), pp. 934--942. https://doi.org/10.1016/j.disc.2018.11.025; E. Mohr and D. Rautenbach. “On the maximum number of maximum independent sets in connected graphs”. In: Journal of Graph Theory 96 (2021), pp. 510--521. https://doi.org/10.1002/jgt.22629; E. Mohr and D. Rautenbach. “On Hamiltonian cycles in claw-free cubic graphs”. In: Discussiones Mathematicae Graph Theory (to appear). https://doi.org/10.7151/dmgt.2249; S. Ehard and E. Mohr. “Rainbow triangles and cliques in edge-colored graphs”. In: European Journal of Combinatorics 84 (2020), p. 103037. https://doi.org/10.1016/j.ejc.2019.103037; M. A. Henning, E. Mohr, and D. Rautenbach. “On the maximum number of minimum total dominating sets in forests”. In: Discrete Mathematics & Theoretical Computer Science 21.3 (2019). https://doi.org/10.23638/DMTCS-21-3-3; E. Mohr and D. Rautenbach. “On the Maximum Number of Maximum Independent Sets”. In: Graphs and Combinatorics 34 (2018), pp. 1729--1740. https://doi.org/10.1007/s00373-018-1969-6; http://dx.doi.org/10.18725/OPARU-36784; https://oparu.uni-ulm.de/xmlui/123456789/36846; http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-36846-0

Availability: https://doi.org/10.18725/OPARU-3678410.1016/j.disc.2018.11.02510.1002/jgt.2262910.7151/dmgt.224910.1016/j.ejc.2019.10303710.1007/s00373-018-1969-6
https://oparu.uni-ulm.de/xmlui/123456789/36846
http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-36846-0

Zugang prüfen (DOI)

Save to List
13
Dissertation/ Thesis
Domination and forcing

Authors: Gentner, Michael

Contributors: Rautenbach, Dieter, Bruhn-Fujimoto, Henning

Subject Terms: Zero Forcing, DDC 510 / Mathematics, Graph theory, Domination (Graph theory), Graphentheorie, Dominanzzahl

File Description: application/pdf

Relation: Michael Gentner, Michael A. Henning and Dieter Rautenbach, 2016, Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence, Discrete Applied Mathematics 206 pp.181-187, DOI:10.1016/j.dam.2016.01.040; Michael Gentner, Michael A. Henning and Dieter Rautenbach, 2016, Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence, Journal of Graph Theory, DOI:10.1002/jgt.22189; Michael Gentner and Dieter Rautenbach, 2017, Some Comments on the Slater number, Discrete Mathematics 340 pp.1497-1502, DOI:10.1016/j.disc.2017.02.009; Michael Gentner and Dieter Rautenbach, 2018, Some Bounds on the Zero Forcing Number of a Graph, Discrete Applied Mathematics 236 pp.203-213, DOI:10.1016/j.dam.2017.11.015; Michael Gentner, Lucia D. Penso, Ueverton S. Souza, and Dieter Rautenbach, Extremal values and bounds for the zero forcing number, Discrete Applied Mathematics 214 pp.196-200, DOI:10.1016/j.dam.2016.06.004; http://dx.doi.org/10.18725/OPARU-5428; https://oparu.uni-ulm.de/xmlui/123456789/5485; http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-5485-3

Availability: https://doi.org/10.18725/OPARU-542810.1016/j.dam.2016.01.04010.1002/jgt.2218910.1016/j.disc.2017.02.00910.1016/j.dam.2017.11.01510.1016/j.dam.2016.06.004
https://oparu.uni-ulm.de/xmlui/123456789/5485
http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-5485-3

Zugang prüfen (DOI)

Save to List
16
Dissertation/ Thesis
Exponential domination, exponential independence, and the clustering coefficient

Authors: Jäger, Simon

Contributors: Rautenbach, Dieter, Bruhn-Fujimoto, Henning

Subject Terms: Domination, Exponential domination, Porous exponential domination, Hereditary class, Independence, Exponential independence, Clustering coefficient, Connected caveman graph, DDC 510 / Mathematics, Domination (Graph theory), Graph theory, Independence (Mathematics), Graphentheorie, Unabhängige Menge

File Description: application/pdf

Relation: M.A. Henning, S. Jäger, D. Rautenbach, Relating domination, exponential domination, and porous exponential domination, Discrete Optimization 23 (2017) 81-92, http://dx.doi.org/10.1016/j.disopt.2016.12.002.; M.A. Henning, S. Jäger, D. Rautenbach, Hereditary equality of domination and exponential domination, Discussiones Mathematicae Graph Theory (2016), doi:10.7151/dmgt.2006.; S. Jäger, D. Rautenbach, Exponential independence, Discrete Mathematics 340 (2017) 2650-2658, http://dx.doi.org/10.1016/j.disc.2016.10.018.; M. Gentner, I. Heinrich, S. Jäger, D. Rautenbach, Large values of the clustering coefficient, Discrete Mathematics 341 (2018) 119-125, http://dx.doi.org/10.1016/j.disc.2017.08.020.; http://dx.doi.org/10.18725/OPARU-4537; 100667179X; https://oparu.uni-ulm.de/xmlui/123456789/4576; http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-4576-4

Availability: https://doi.org/10.18725/OPARU-453710.1016/j.disopt.2016.12.00210.7151/dmgt.200610.1016/j.disc.2016.10.01810.1016/j.disc.2017.08.020
https://oparu.uni-ulm.de/xmlui/123456789/4576
http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-4576-4

Zugang prüfen (DOI)

Save to List