Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimal imperfect graphs: A simple approach

From MaRDI portal
Publication:1924490
Jump to:navigation, search

DOI10.1007/BF01844846zbMath0858.05044MaRDI QIDQ1924490

G. S. Gasparian

Publication date: 11 March 1997

Published in: Combinatorica (Search for Journal in Brave)


zbMATH Keywords

independent setperfect graphsclique


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)


Related Items (7)

Attempting perfect hypergraphs ⋮ Problems and results on 1-cross-intersecting set pair systems ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ On ideal clutters, metrics and multiflows ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Non-regular square bipartite designs ⋮ Point partition numbers: perfect graphs



Cites Work

  • Graphical properties related to minimal imperfection
  • On certain polytopes associated with graphs
  • A characterization of perfect graphs
  • Normal hypergraphs and the perfect graph conjecture
  • Perfect zero–one matrices
  • Unnamed Item


This page was built for publication: Minimal imperfect graphs: A simple approach

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1924490&oldid=14356503"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki