A note on path-perfect graphs

DOI10.1016/0012-365X(81)90262-4zbMATH Open0447.05037MaRDI QIDQ1146196FDOQ1146196

Authors: John Frederick Fink, H. Joseph Straight 

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathsfactoring a graphpath-perfect graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• On ascending subgraph decomposition of graphs
• Decomposition of a complete graph into trails of given lengths
• Packing of graphs - a survey
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs

This page was built for publication: A note on path-perfect graphs

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