scientific article; zbMATH DE number 4144020

MaRDI QIDQ3475295zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

chromatic graphMenger's theoremsystems of paths

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4104981
• Constructing graphs with no immersion of large complete graphs
• Complete graph immersions and minimum degree
• A minimum degree condition forcing complete graph immersion

Cited in

(4)

• The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
• The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
• scientific article; zbMATH DE number 4104981 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics

This page was built for publication:

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