Long cycles and neighborhood union in 1-tough graphs with large degree sums
Vu Dinh Hoa (1998)
Discussiones Mathematicae Graph Theory
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Vu Dinh Hoa (1998)
Discussiones Mathematicae Graph Theory
Similarity:
Jean-Luc Fouquet, Jean-Marie Vanherpe (2010)
Discussiones Mathematicae Graph Theory
Similarity:
A conjecture of Mácajová and Skoviera asserts that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.
Antoni Marczyk
Similarity:
Our aim is to survey results in graph theory centered around four themes: hamiltonian graphs, pancyclic graphs, cycles through vertices and the cycle structure in a graph. We focus on problems related to the closure result of Bondy and Chvátal, which is a common generalization of two fundamental theorems due to Dirac and Ore. We also describe a number of proof techniques in this domain. Aside from the closure operation we give some applications of Ramsey theory in the research of cycle...
Herbert Fleischner (1974)
Archivum Mathematicum
Similarity:
R. Conti (1990)
Annales Polonici Mathematici
Similarity:
Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs
Halina Bielak, Kamil Powroźnik (2015)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica
Similarity:
In this paper we study some distance properties of outerplanar graphs with the Hamiltonian cycle whose all bounded faces are cycles isomorphic to the cycle C4. We call this family of graphs quadrangular outerplanar graphs. We give the lower and upper bound on the double branch weight and the status for this graphs. At the end of this paper we show some relations between median and double centroid in quadrangular outerplanar graphs.
Halina Bielak, Kamil Powroźnik (2015)
Annales UMCS, Mathematica
Similarity:
In this paper we study some distance properties of outerplanar graphs with the Hamiltonian cycle whose all bounded faces are cycles isomorphic to the cycle C4. We call this family of graphs quadrangular outerplanar graphs. We give the lower and upper bound on the double branch weight and the status for this graphs. At the end of this paper we show some relations between median and double centroid in quadrangular outerplanar graphs
Jin Akiyama, Geoffrey Exoo, Frank Harary (1980)
Mathematica Slovaca
Similarity:
Ralph Faudree, Annette Schelten, Ingo Schiermeyer (2003)
Discussiones Mathematicae Graph Theory
Similarity:
Bondy and Erdős [2] have conjectured that the Ramsey number for three cycles Cₖ of odd length has value r(Cₖ,Cₖ,Cₖ) = 4k-3. We give a proof that r(C₇,C₇,C₇) = 25 without using any computer support.
Peter J. Owens, Hansjoachim Walther (1995)
Discussiones Mathematicae Graph Theory
Similarity:
The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown to contain non-hamiltonian graphs and to have a shortness exponent smaller than one.
Ligang Jin, Eckhard Steffen, Giuseppe Mazzuoccolo (2018)
Discussiones Mathematicae Graph Theory
Similarity:
The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection. Both of these two conjectures can be related to conjectures on Fano-flows. In this paper, we show that these two conjectures are equivalent to some statements on cores and weak cores of a bridgeless cubic graph. In particular, we prove that the Fan-Raspaud...
Mohammad Javaheri (2016)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Renata Kawa (2010)
Discussiones Mathematicae Graph Theory
Similarity:
We give "if and only if" characterization of graphs with the following property: given n ≥ 3, edges of such graphs form matroids with circuits from the collection of all graphs with n fundamental cycles. In this way we refer to the notion of matroidal family defined by Simões-Pereira [2].