Perfect product graphs

DOI10.1016/0012-365X(77)90056-5zbMath0371.05028WikidataQ29398519 ScholiaQ29398519MaRDI QIDQ1243282

G. Ravindra, K. R. Parthasarathy

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Restricted coloring models for timetabling, On the optimal transversals of the odd cycles, Partially concurrent open shop scheduling with integral preemptions, Graphs defined on groups, Maximal ambiguously \(k\)-colorable graphs, Research problems, Diameter of colorings under Kempe changes, Duality for semiantichains and unichain coverings in products of special posets, SOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPS, Strongly perfect products of graphs, Minimax relations for the partial q-colorings of a graph, On perfectness of sums of graphs, Forbidden subgraphs in generating graphs of finite groups, On maximum independent set of categorical product and ultimate categorical ratios of graphs

Cites Work

• The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Perfectness of normal products of graphs
• A characterization of perfect graphs
• Unnamed Item