Perfect product graphs

DOI10.1016/0012-365X(77)90056-5MaRDI QIDQ1243282zbMATH OpenWikidataFDO

Authors G. Ravindra, K. R. Parthasarathy

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3390792 (Why is no real title available?)
• A characterization of perfect graphs
• Perfectness of normal products of graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs

Cited in

(14)

• On maximum independent set of categorical product and ultimate categorical ratios of graphs
• On perfectness of sums of graphs
• Partially concurrent open shop scheduling with integral preemptions
• On the optimal transversals of the odd cycles
• Duality for semiantichains and unichain coverings in products of special posets
• Some properties on the disjunctive product over graphs of monogenic semigroups
• Minimax relations for the partial q-colorings of a graph
• Diameter of colorings under Kempe changes
• Maximal ambiguously \(k\)-colorable graphs
• Strongly perfect products of graphs
• Restricted coloring models for timetabling
• Graphs defined on groups
• Research problems
• Forbidden subgraphs in generating graphs of finite groups

This page was built for publication: Perfect product graphs

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