arXiv Open Access 2015

Characterization of graphs without even $F$-orientations

M. Abreu D. Labbate F. Romaniello J. Sheehan

Lihat Sumber

Abstrak

A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even number of edges directed in the same fixed direction around the cycle. In this paper, we examine the structure of 1-extendible graphs $G$ which have no even $F$-orientation where $F$ is a fixed $1$-factor of $G$. In the case of graphs of connectivity at least four and k-regular graphs for $k \geq 3$ we give a complete characterization.

Topik & Kata Kunci

math.CO

Penulis (4)

M. Abreu

D. Labbate

F. Romaniello

J. Sheehan

Format Sitasi

APA MLA BibTeX

Abreu, M., Labbate, D., Romaniello, F., Sheehan, J. (2015). Characterization of graphs without even $F$-orientations. https://arxiv.org/abs/1501.02437

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓