On arc-coloring of subcubic graphs.
Pinlou, Alexandre (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Partial line graph operator and half-arc-transitive group actions”
On arc-coloring of subcubic graphs.
Arc-transitive non-Cayley graphs from regular maps.
Gvozdjak, P., Širáň, J. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Consistent cycles in 1/2-arc-transitive graphs.
Boben, Marko, Miklavic, Stefko, Potocnik, Primoz (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Involutory Pairs of Vertices in Transitive Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity:
Closed walks in coset graphs and vertex-transitive non-Cayley graphs.
Kurcz, R. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Fixing numbers of graphs and groups.
Gibbons, Courtney R., Laison, Joshua D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
Branković, Ljiljana, Miller, Mirka, Plesník, Ján, Ryan, Joe, Širáň, Jozef (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Frucht’s Theorem for the Digraph Factorial
Richard H. Hammack (2013)
Discussiones Mathematicae Graph Theory
Similarity:
To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms...