id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_vwm4xtbzwzfmfm6ii6dxhlfqzq	Adrian Bondy	Beautiful conjectures in graph theory	2014	45	.pdf	application/pdf	1595	258	77	Every simple graph on at least four edges is Edge Reconstruction Conjecture Edge Reconstruction Conjecture True for graphs on n vertices and more Every connected simple graph on n vertices can Every simple graph on n vertices without cut Every graph without cut edges has a double Every graph without cut edges has a double Matching Double Cover Conjecture Circuit Double Cover Conjecture Circuit Double Cover Conjecture True for graphs in which some vertex is Cycle Double Cover Conjecture Cycle Double Cover Conjecture True for 4-edge-connected graphs. Every 4-edge-connected graph has a 4-flow. Every 4-edge-connected graph has a 4-flow. Every 4-edge-connected graph has a 4-flow. Every longest circuit in a 3-connected graph has Hamilton Circuits in Line Graphs Thomassen's Line Graph Conjecture Every simple 4-regular graph with a Hamilton Given a Hamilton circuit in a 3-regular graph, Hamilton Circuits in 4-Connected Every 4-connected graph with a Hamilton circuit has a second Hamilton circuit	./cache/work_vwm4xtbzwzfmfm6ii6dxhlfqzq.pdf	./txt/work_vwm4xtbzwzfmfm6ii6dxhlfqzq.txt