On perfectness of sums of graphs
DOI10.1016/S0012-365X(98)00168-XzbMATH Open0935.05049DBLPjournals/dm/WerraH99OpenAlexW2016883172WikidataQ56001820 ScholiaQ56001820MaRDI QIDQ1296974FDOQ1296974
Authors: Alain Hertz, Dominique De Werra 
Publication date: 4 May 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00168-x
Recommendations
- Sum-perfect graphs
- A Sum of Squares Characterization of Perfect Graphs
- On the permanental sum of graphs
- On the perfect graph conjecture
- Some conjectures on perfect graphs
- scientific article; zbMATH DE number 733851
- A note on perfect graphs
- Perfect graphs and norms
- A new characterization of perfect graphs
- scientific article; zbMATH DE number 3869356
characterizationindependent setblock graphBerge graphparity graphflag-free graphperfect sum graphstriangulated diamond-free graph
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Cites Work
- Title not available (Why is that?)
- Coloring perfect \((K_ 4\)-e)-free graphs
- Paw-free graphs
- Title not available (Why is that?)
- Decomposition of perfect graphs
- Title not available (Why is that?)
- A new property of critical imperfect graphs and some consequences
- Title not available (Why is that?)
- Restrictions and preassignments in preemptive open shop scheduling
- Perfect product graphs
- Locally perfect graphs
Cited In (11)
- The maximum \(k\)-colorable subgraph problem and orbitopes
- A Sum of Squares Characterization of Perfect Graphs
- Some extremal graphs with respect to permanental sum
- On the optimal transversals of the odd cycles
- A Theorem on Sum Graphs
- Duality for semiantichains and unichain coverings in products of special posets
- Minimax relations for the partial q-colorings of a graph
- Title not available (Why is that?)
- Restricted coloring models for timetabling
- Graphs omitting sums of complete graphs
- Motives associated to sums of graphs
This page was built for publication: On perfectness of sums of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296974)
