2014
DOI: 10.1007/s10878-014-9797-y
|View full text |Cite
|
Sign up to set email alerts
|

On Barnette’s conjecture and the $$H^{+-}$$ H + - property

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
8
0
1

Year Published

2018
2018
2020
2020

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 6 publications
1
8
0
1
Order By: Relevance
“…From (7), it follows that every graph (G, g) ∈ S n , for n > 10, is also opequivalent to one of the above graphs (or to a mirror reflection of one of them, for n odd). Finally, by (8) and Lemma 3.2, every graph (G, g) ∈ S n , different than (H 7 , g), has a hamiltonian set which is (±)compatible with the orientation of c(G). Lemma 4.6.…”
Section: Hamiltonian Sets In Graphs Of Small Heightsmentioning
confidence: 95%
See 1 more Smart Citation
“…From (7), it follows that every graph (G, g) ∈ S n , for n > 10, is also opequivalent to one of the above graphs (or to a mirror reflection of one of them, for n odd). Finally, by (8) and Lemma 3.2, every graph (G, g) ∈ S n , different than (H 7 , g), has a hamiltonian set which is (±)compatible with the orientation of c(G). Lemma 4.6.…”
Section: Hamiltonian Sets In Graphs Of Small Heightsmentioning
confidence: 95%
“…Observe that, for an even n, there exists exactly 8 2 +8 = 36 different graphs in S n . Similarly, for an odd n, there exists exactly 2 8 2 + 8 = 64 different graphs in S n . Hence, by the definition of ω, it is not difficult to check that every graph (G, g) ∈ S n , where 6 n 10, is op-equivalent to one of the following graphs (or to a mirror reflection of one of them, for n odd):…”
Section: Hamiltonian Sets In Graphs Of Small Heightsmentioning
confidence: 96%
“…Lysenko, Makarowicz, Ko kin, Šklarevskij 2011). 7 Por. Svešnikov 1968;Górski 1996Górski , 2010Kempisty 1967Kempisty , 1978Florek, Taras 2003;Makarowicz 2008Makarowicz , 2009Makarowicz , 2010aMakarowicz , 2010bMakarowicz, Lysenko, Ko kin 2013. 8 Sulimirski 1964, 1968Makarowicz 2008Makarowicz , 20092010b, 311-317. cji fizyczno-geograficznej teren ów jest fragmentem Przedkarpacia, granicz cym od północy z Wy yn Podolsk , a pod wzgl dem regionalizacji etnograficznej le y on w Galicji 9 .…”
Section: Usytuowanie Cmentarzyska I Układ Przestrzenny Kurhanówunclassified
“…Denote by B i the set of all big vertices in V i , i = 1, 2, 3. Let P G denote the family of all paths P of length at least 2 in G, with big ends and small inner vertices such that either P is an induced path in G, or the ends a, b of P are adjacent and P + ab is an induced cycle in G. Florek [4] proved the following lemma:…”
mentioning
confidence: 99%
“…Hence, by the Stein theorem, {e * ∈ E(G * ) : e ∈ E(S, T )} is the set of edges of a Hamilton cycle in the dual graph G * . Moreover, Florek [4]…”
mentioning
confidence: 99%