Orthogonal [k-1,k+1]-factorizations in graphs

DOI10.1016/0378-3758(95)00084-4MaRDI QIDQ1918196zbMATH OpenOpenAlexWikidataFDO

Authors Guizhen Liu, Guiying Yan

Publication date 25 November 1996

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0378-3758(95)00084-4

zbMATH Keywords

factorization matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Orthogonal \([k-1,k+1]\)-factorizations in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918196)