Line perfect graphs (Q4141848): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/mp/Trotter77, #quickstatements; #temporary_batch_1739530294150 |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Leslie E. jun. Trotter / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56388864 / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Leslie E. jun. Trotter / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Establishing the matching polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5603088 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5668821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain polytopes associated with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti-blocking polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5685113 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5799732 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01593791 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994363553 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/mp/Trotter77 / rank | |||
Normal rank |
Latest revision as of 12:54, 14 February 2025
scientific article; zbMATH DE number 3570498
Language | Label | Description | Also known as |
---|---|---|---|
English | Line perfect graphs |
scientific article; zbMATH DE number 3570498 |
Statements
Line perfect graphs (English)
0 references
1977
0 references