Tough graphs and Hamiltonian circuits. (Reprint) (Q2497990): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.03.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210762532 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576241 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4041607 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5782525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5580168 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamilton's ideals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on Hamiltonian circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Existence of k-edge connected ordinary graphs with prescribed degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The square of every nonseparable graph is Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5547252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs and Subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5722819 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles and Connectivity in Graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:43, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tough graphs and Hamiltonian circuits. (Reprint) |
scientific article |
Statements
Tough graphs and Hamiltonian circuits. (Reprint) (English)
0 references
4 August 2006
0 references
