Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3258698 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest coverings of graphs with cycles / 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: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank | |||
Normal rank | |||
Latest revision as of 12:06, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs |
scientific article |
Statements
Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (English)
0 references
6 July 2015
0 references
Chinese postman problem
0 references
regular graph
0 references
parity subgraph
0 references
balloon
0 references
