(g,f)-factorizations of graphs orthogonal to [1,2]-subgraphs

DOI10.1007/BF02009545zbMATH Open0885.05091WikidataQ114233889 ScholiaQ114233889MaRDI QIDQ1375339FDOQ1375339

Gunying Yan

Publication date: 30 March 1998

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

\((g,f)\)-factorization\((g,f)\)-graphorthogonal factor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Subgraphs with prescribed valencies
• Orthogonal \((g,f)\)-factorizations in graphs
• \((g,f)\)-factorization orthogonal to a star in graphs

Cited In (8)

• A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Existence of subgraphs with orthogonal \((g,f)\)-factorization
• Orthogonal \((g,f)\)-factorizations of bipartite graphs
• Title not available (Why is that?)
• A \((g,f)\)-factorization 2-orthogonal to a few types of subgraphs

This page was built for publication: \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs

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