Autor: Xiong, Liming - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Hamiltonian Extendable Graphs
Autorzy:: Yang, Xiaojing
Xiong, Liming
Powiązania:: https://bibliotekanauki.pl/articles/32304150.pdf
Data publikacji:: 2022-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Hamiltonian extendable
forbidden subgraph
Opis:: A graph is called Hamiltonian extendable if there exists a Hamiltonian path between any two nonadjacent vertices. In this paper, we give an explicit formula of the minimum number of edges for Hamiltonian extendable graphs and we also characterize the degree sequence for Hamiltonian extendable graphs with minimum number of edges. Besides, we completely characterize the pairs of forbidden subgraphs for 2-connected graphs to be Hamiltonian extendable.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 3; 843-859
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Forbidden Subgraphs for Collapsible Graphs and Supereulerian Graphs
Autorzy:: Liu, Xia
Xiong, Liming
Powiązania:: https://bibliotekanauki.pl/articles/32361726.pdf
Data publikacji:: 2022-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: forbidden subgraph
supereulerian
collapsible
Opis:: In this paper, we completely characterize the connected forbidden subgraphs and pairs of connected forbidden subgraphs that force a 2-edge-connected (2-connected) graph to be collapsible. In addition, the characterization of pairs of connected forbidden subgraphs that imply a 2-edge-connected graph of minimum degree at least three is supereulerian will be considered. We have given all possible forbidden pairs. In particular, we prove that every 2-edge-connected noncollapsible (or nonsupereulerian) graph of minimum degree at least three is Z₃-free if and only if it is K₃-free, where Z_i is a graph obtained by identifying a vertex of a K₃ with an end-vertex of a P_i+1.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 2; 417-442
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja