Orthogonal \([k-1,k+1]\)-factorizations in graphs
type: Item
instance of: scholarly article
title: Orthogonal \([k-1,k+1]\)-factorizations in graphs
zbMATH Open document ID: 0852.05071
DOI: 10.1016/0378-3758(95)00084-4
published in: Journal of Statistical Planning and Inference
publication date: 1996-11-25T00:00:00Z
review text: Let \(G\) be a graph. Let \(F= \{F_1, F_2,\dots, F_d\}\) be a factorization of \(G\), and let \(H\) be a subgraph of \(G\). If \(H\) has exactly one edge in common with \(F_i\) for all \(i= 1,2,\dots, d\), then we say that \(F\) is orthogonal to \(H\). This paper proves that for any \(d\)-matching \(M\) of a \([kd- 1, kd+ 1]\)-graph \(G\), there is a \([k- 1, k+ 1]\)-factorization of \(G\) orthogonal to \(M\) where \(k\geq 2\) is an integer.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 906658
zbMATH Keywords: matching
zbMATH Keywords: factorization
Wikidata QID: Q114214689
author: Guizhen Liu
author: Guiying Yan
MaRDI profile type: Publication
full work available at URL: 0378-3758(95)00084-4
OpenAlex ID: W1983440656
cites work: Q4731216
cites work: Subgraphs with prescribed valencies
cites work: Note on Hamilton Circuits
description: scientific article; zbMATH DE number 906658