In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp
AbstractKaterinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a r...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
By Petersen’s Theorem, a bridgeless cubic graph has a 2-factor. Fleischner (<i>Discrete Math.</i>, 1...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
[[abstract]]A parity walk in an edge-coloring of a graph is a walk along which each color is used an...
Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a regular b...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
AbstractKaterinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a r...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
By Petersen’s Theorem, a bridgeless cubic graph has a 2-factor. Fleischner (<i>Discrete Math.</i>, 1...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
[[abstract]]A parity walk in an edge-coloring of a graph is a walk along which each color is used an...
Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a regular b...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
AbstractKaterinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a r...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
DOI
Add to ORKG