Autor: West, Douglas B. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected
Autorzy:: Lu, Xiaoyun
West, Douglas B.
Powiązania:: https://bibliotekanauki.pl/articles/31340879.pdf
Data publikacji:: 2016-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: 4-connected planar graph
Hamiltonian-connected
Tutte-path
Opis:: We prove a theorem guaranteeing special paths of faces in 2-connected plane graphs. As a corollary, we obtain a new proof of Thomassen’s theorem that every 4-connected planar graph is Hamiltonian-connected.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 3; 555-564
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Antipodal Edge-Colorings of Hypercubes
Autorzy:: West, Douglas B.
Wise, Jennifer I.
Powiązania:: https://bibliotekanauki.pl/articles/31343560.pdf
Data publikacji:: 2019-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: antipodal edge-coloring
hypercube
monochromatic geodesic
Opis:: Two vertices of the k-dimensional hypercube Q_k are antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y. An antipodal edge-coloring of Q_k is a 2- edge-coloring such that antipodal edges always have different colors. Norine conjectured that for k ≥ 2, in every antipodal edge-coloring of Q_k some two antipodal vertices are connected by a monochromatic path. Feder and Subi proved this for k ≤ 5. We prove it for k ≤ 6.
Źródło:: Discussiones Mathematicae Graph Theory; 2019, 39, 1; 271-284
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: The 1,2,3-Conjecture and 1,2-Conjecture for sparse graphs
Autorzy:: Cranston, Daniel W.
Jahanbekam, Sogol
West, Douglas B.
Powiązania:: https://bibliotekanauki.pl/articles/30148718.pdf
Data publikacji:: 2014-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: reducible configuration
discharging method
1, 2, 3-Conjecture
1, 2-Conjecture
Opis:: The 1, 2, 3-Conjecture states that the edges of a graph without isolated edges can be labeled from {1, 2, 3} so that the sums of labels at adjacent vertices are distinct. The 1, 2-Conjecture states that if vertices also receive labels and the vertex label is added to the sum of its incident edge labels, then adjacent vertices can be distinguished using only {1, 2}. We show that various configurations cannot occur in minimal counterexamples to these conjectures. Discharging then confirms the conjectures for graphs with maximum average degree less than 8/3. The conjectures are already confirmed for larger families, but the structure theorems and reducibility results are of independent interest.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 4; 769-799
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja