scientific article; zbMATH DE number 4177086

MaRDI QIDQ3201076zbMATH OpenFDO

Authors Manfred Koebe

Publication date 1990

zbMATH Keywords

colouringmaximum set problemSpider graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 125465
• scientific article; zbMATH DE number 1123806
• scientific article; zbMATH DE number 4051024
• Tough spiders
• Path multicoloring in spider graphs with even color multiplicity

Cited in

(11)

• Vertex labeling of spider graph
• scientific article; zbMATH DE number 6277728 (Why is no real title available?)
• scientific article; zbMATH DE number 4051024 (Why is no real title available?)
• Maximum independent set and maximum clique algorithms for overlap graphs
• Thresholds for classes of intersection graphs
• Spider covers and their applications
• Spiders can be recognized by counting their legs
• scientific article; zbMATH DE number 125465 (Why is no real title available?)
• Spider web graphs
• Path multicoloring in spider graphs with even color multiplicity
• Tough spiders

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 Q3201076)