scientific article; zbMATH DE number 3847441

MaRDI QIDQ3317150zbMATH OpenFDO

Authors Christopher A. Meacham, F. R. McMorris

Publication date 1983

zbMATH Keywords

chromatic numberintersection graphclique covering

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4068928
• Recent examples in the theory of partition graphs
• On partition graphs
• A characterization and hereditary properties for partition graphs
• On the intersection number of a graph

Cited in

(9)

• Two strikes against perfect phylogeny
• scientific article; zbMATH DE number 4068928 (Why is no real title available?)
• About some robustness and complexity properties of G-graphs networks
• Minimizing phylogenetic number to find good evolutionary trees
• scientific article; zbMATH DE number 3867385 (Why is no real title available?)
• A characterization and hereditary properties for partition graphs
• scientific article; zbMATH DE number 4025485 (Why is no real title available?)
• On graphs induced by non-empty subsets
• Applications of edge coverings by cliques

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