Halin graphs and the travelling salesman problem (Q4744083): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The traveling salesman problem in graphs with 3-edge cutsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5675543 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4174517 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Family of Planar Bicritical Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dual integrality in b-matching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum dominating cycles in outerplanar graphs / rank | |||
Normal rank |
Revision as of 18:15, 13 June 2024
scientific article; zbMATH DE number 3799427
Language | Label | Description | Also known as |
---|---|---|---|
English | Halin graphs and the travelling salesman problem |
scientific article; zbMATH DE number 3799427 |
Statements
Halin graphs and the travelling salesman problem (English)
0 references
1983
0 references
Halin graph
0 references
hamilton cycles
0 references
travelling salesman problem
0 references
polynomial algorithm
0 references
integer polytope
0 references
polyhedral combinatorics
0 references
roofless polyhedron
0 references
edge cutset
0 references