نتائج البحث

Efficient Enumeration of Non-isomorphic Interval Graphs.

• Authors : Mikos, Patryk¹

• Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2021, Vol. 23 Issue 1, p1-23. 23p.

تفاصيل العنوان

Super edge-connectivity and matching preclusion of data center networks.

• Authors : Huazhong Lü¹; Tingzeng Wu²

• Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-20. 20p.

تفاصيل العنوان

On almost hypohamiltonian graphs.

• Authors : Goedgebeur, Jan^1,2; Zamfirescu, Carol T.^1,3

• Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-18. 18p.

تفاصيل العنوان

Graphs, Networks and Natural Reality - from Intuitive Abstracting to Theory.

• Authors : Linfan MAO^1,2

• Source: International Journal of Mathematical Combinatorics. Dec2019, p1-18. 18p.

تفاصيل العنوان

Power domination in maximal planar graphs.

• Authors : Dorbec, Paul¹; González, Antonio²; Pennarun, Claire³

• Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-24. 24p.

تفاصيل العنوان

Generalized Petersen Graphs and Kronecker Covers.

• Authors : Krnc, Matjaž^1,2,3 ; Pisanski, Tomaž¹

• Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-16. 16p.

تفاصيل العنوان

In Search of Hyperpaths.

• Authors : Dahari, Amir¹ (AUTHOR) ; Linial, Nathan¹ (AUTHOR)

Subjects: *GRAPH theory; *LINEAR algebra; *MATRIX multiplications

• Source: Discrete & Computational Geometry. Mar2023, Vol. 69 Issue 2, p399-421. 23p.

تفاصيل العنوان

Compound matrices in systems and control theory: a tutorial.

• Authors : Bar-Shalom, Eyal¹ (AUTHOR); Dalin, Omri¹ (AUTHOR); Margaliot, Michael¹ (AUTHOR)

• Source: Mathematics of Control, Signals & Systems. Sep2023, Vol. 35 Issue 3, p467-521. 55p.

تفاصيل العنوان

Extending edge‐colorings of complete hypergraphs into regular colorings.

• Authors : Bahmanian, Amin¹

• Source: Journal of Graph Theory. Apr2019, Vol. 90 Issue 4, p547-560. 14p.

تفاصيل العنوان

Strong immersion is a well‐quasi‐ordering for semicomplete digraphs.

• Authors : Barbero, Florian¹; Paul, Christophe¹ ; Pilipczuk, Michał²

• Source: Journal of Graph Theory. Apr2019, Vol. 90 Issue 4, p484-496. 13p.

تفاصيل العنوان