scientific article; zbMATH DE number 4177086

zbMATH Open0715.05024MaRDI QIDQ3201076FDOQ3201076

Authors: Manfred Koebe 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

colouringmaximum set problemSpider graphs

Mathematics Subject Classification ID

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

Cited In (11)

• Vertex labeling of spider graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)