scientific article; zbMATH DE number 25254

MaRDI QIDQ3983100zbMATH OpenFDO

Authors P. Erdős

Publication date 27 June 1992

zbMATH Keywords

problems in graph theory

Mathematics Subject Classification ID

Problem books (00A07) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Designs and configurations (05Bxx) Graph theory (05Cxx)

Recommendations

• SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
• scientific article; zbMATH DE number 125455
• A few results on block-colourings of designs
• scientific article; zbMATH DE number 3817719
• scientific article; zbMATH DE number 4127217
• scientific article; zbMATH DE number 969181
• On the block number of graphs
• scientific article; zbMATH DE number 2242445
• The connectivity of the block-intersection graphs of designs

Cited in

(15)

• Computational experience with approximation algorithms for the set covering problem
• The complexity of finding fair independent sets in cycles
• Cooperative colorings and independent systems of representatives
• An algorithm for identifying cycle-plus-triangles graphs
• scientific article; zbMATH DE number 3817719 (Why is no real title available?)
• scientific article; zbMATH DE number 3936281 (Why is no real title available?)
• scientific article; zbMATH DE number 4029581 (Why is no real title available?)
• scientific article; zbMATH DE number 25260 (Why is no real title available?)
• scientific article; zbMATH DE number 3600035 (Why is no real title available?)
• Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
• On finding constrained independent sets in cycles
• Partitioning into common independent sets via relaxing strongly base orderability
• Constructing graphs with no independent transversals
• A reduction of the ``cycles plus \(K_4\)'s problem
• The complexity of finding fair independent sets in cycles

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