Semisymmetric cubic graphs of order .

Alaeiyan, Mehdi; Onagh, B.N.

Displaying similar documents to “Semisymmetric cubic graphs of order $4 p^{n}$ .”

Cubic edge-transitive graphs of order $4 p^{2}$ .

Alaeiyan, M., Onagh, B.N. (2009)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Dualizing cubic graph theory

T. McKee (1988)

Fundamenta Mathematicae

Similarity:

Characterization of simple orbit graphs.

Bretto, Alain, Faisant, Alain, Jaulin, Cerasela, Tomanová, Jana (2010)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Calculating the number of the linear factors in planar graphs.

Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)

Acta Universitatis Apulensis. Mathematics - Informatics

Similarity:

Note on seed graphs with components of given order.

Fronček, D. (2000)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Constructions for cubic graphs with large girth.

Biggs, Norman (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Derived graphs of some graphs

Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)

Kragujevac Journal of Mathematics

Similarity:

Smallest cubic and quartic graphs with a given number of cutpoints and bridges.

Chartrand, Gary, Saba, Farrokh, Cooper, John K.jun., Harary, Frank, Wall, Curtiss E. (1982)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Mácajová and Škoviera conjecture on cubic graphs

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.