Prepare a minimal graph for making the algo fail
Simplify rome 2939.19 for error detection. See log attached: 


Only remove lonely:


		graph.addEdge(edges.get( 0), vertices.get( 2), vertices.get( 0));
		graph.addEdge(edges.get( 3), vertices.get( 9), vertices.get( 2));
		graph.addEdge(edges.get( 5), vertices.get( 9), vertices.get( 5));
		graph.addEdge(edges.get( 6), vertices.get( 5), vertices.get(10));
		graph.addEdge(edges.get( 7), vertices.get(10), vertices.get( 6));
		graph.addEdge(edges.get( 8), vertices.get( 6), vertices.get(11));
		graph.addEdge(edges.get( 9), vertices.get( 7), vertices.get(13));
		graph.addEdge(edges.get(10), vertices.get(13), vertices.get( 5));
		graph.addEdge(edges.get(11), vertices.get(11), vertices.get( 2));
		graph.addEdge(edges.get(12), vertices.get( 1), vertices.get(14));
		graph.addEdge(edges.get(13), vertices.get(14), vertices.get( 0));
		graph.addEdge(edges.get(14), vertices.get(15), vertices.get( 5));
		graph.addEdge(edges.get(15), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get(16), vertices.get(16), vertices.get( 2));
		graph.addEdge(edges.get(17), vertices.get(16), vertices.get( 9));
		graph.addEdge(edges.get(18), vertices.get(16), vertices.get(13));
		graph.addEdge(edges.get(19), vertices.get(16), vertices.get( 5));
		graph.addEdge(edges.get(20), vertices.get(16), vertices.get(10));
		graph.addEdge(edges.get(21), vertices.get( 7), vertices.get( 2));
		graph.addEdge(edges.get(24), vertices.get(18), vertices.get( 7));
		graph.addEdge(edges.get(25), vertices.get(18), vertices.get(15));
		graph.addEdge(edges.get(26), vertices.get(18), vertices.get( 1));
		graph.addEdge(edges.get(27), vertices.get(18), vertices.get(10));


--> 15 cant be removed
11 removed:


		graph.addEdge(edges.get( 0), vertices.get( 2), vertices.get( 0));
		graph.addEdge(edges.get( 3), vertices.get( 9), vertices.get( 2));
		graph.addEdge(edges.get( 5), vertices.get( 9), vertices.get( 5));
		graph.addEdge(edges.get( 6), vertices.get( 5), vertices.get(10));
		graph.addEdge(edges.get( 7), vertices.get(10), vertices.get( 6));
		graph.addEdge(edges.get( 8), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get( 9), vertices.get( 7), vertices.get(13));
		graph.addEdge(edges.get(10), vertices.get(13), vertices.get( 5));
		graph.addEdge(edges.get(12), vertices.get( 1), vertices.get(14));
		graph.addEdge(edges.get(13), vertices.get(14), vertices.get( 0));
		graph.addEdge(edges.get(14), vertices.get(15), vertices.get( 5));
		graph.addEdge(edges.get(15), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get(16), vertices.get(16), vertices.get( 2));
		graph.addEdge(edges.get(17), vertices.get(16), vertices.get( 9));
		graph.addEdge(edges.get(18), vertices.get(16), vertices.get(13));
		graph.addEdge(edges.get(19), vertices.get(16), vertices.get( 5));
		graph.addEdge(edges.get(20), vertices.get(16), vertices.get(10));
		graph.addEdge(edges.get(21), vertices.get( 7), vertices.get( 2));
		graph.addEdge(edges.get(24), vertices.get(18), vertices.get( 7));
		graph.addEdge(edges.get(25), vertices.get(18), vertices.get(15));
		graph.addEdge(edges.get(26), vertices.get(18), vertices.get( 1));
		graph.addEdge(edges.get(27), vertices.get(18), vertices.get(10));


1 removed:

		graph.addEdge(edges.get( 0), vertices.get( 2), vertices.get( 0));
		graph.addEdge(edges.get( 3), vertices.get( 9), vertices.get( 2));
		graph.addEdge(edges.get( 5), vertices.get( 9), vertices.get( 5));
		graph.addEdge(edges.get( 6), vertices.get( 5), vertices.get(10));
		graph.addEdge(edges.get( 7), vertices.get(10), vertices.get( 6));
		graph.addEdge(edges.get( 8), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get( 9), vertices.get( 7), vertices.get(13));
		graph.addEdge(edges.get(10), vertices.get(13), vertices.get( 5));
		graph.addEdge(edges.get(12), vertices.get(18), vertices.get(14));
		graph.addEdge(edges.get(13), vertices.get(14), vertices.get( 0));
		graph.addEdge(edges.get(14), vertices.get(15), vertices.get( 5));
		graph.addEdge(edges.get(15), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get(16), vertices.get(16), vertices.get( 2));
		graph.addEdge(edges.get(17), vertices.get(16), vertices.get( 9));
		graph.addEdge(edges.get(18), vertices.get(16), vertices.get(13));
		graph.addEdge(edges.get(19), vertices.get(16), vertices.get( 5));
		graph.addEdge(edges.get(20), vertices.get(16), vertices.get(10));
		graph.addEdge(edges.get(21), vertices.get( 7), vertices.get( 2));
		graph.addEdge(edges.get(24), vertices.get(18), vertices.get( 7));
		graph.addEdge(edges.get(25), vertices.get(18), vertices.get(15));
		graph.addEdge(edges.get(27), vertices.get(18), vertices.get(10));


14 removed:

		graph.addEdge(edges.get( 0), vertices.get( 2), vertices.get( 0));
		graph.addEdge(edges.get( 3), vertices.get( 9), vertices.get( 2));
		graph.addEdge(edges.get( 5), vertices.get( 9), vertices.get( 5));
		graph.addEdge(edges.get( 6), vertices.get( 5), vertices.get(10));
		graph.addEdge(edges.get( 7), vertices.get(10), vertices.get( 6));
		graph.addEdge(edges.get( 8), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get( 9), vertices.get( 7), vertices.get(13));
		graph.addEdge(edges.get(10), vertices.get(13), vertices.get( 5));
		graph.addEdge(edges.get(12), vertices.get(18), vertices.get( 0));
		graph.addEdge(edges.get(14), vertices.get(15), vertices.get( 5));
		graph.addEdge(edges.get(15), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get(16), vertices.get(16), vertices.get( 2));
		graph.addEdge(edges.get(17), vertices.get(16), vertices.get( 9));
		graph.addEdge(edges.get(18), vertices.get(16), vertices.get(13));
		graph.addEdge(edges.get(19), vertices.get(16), vertices.get( 5));
		graph.addEdge(edges.get(20), vertices.get(16), vertices.get(10));
		graph.addEdge(edges.get(21), vertices.get( 7), vertices.get( 2));
		graph.addEdge(edges.get(24), vertices.get(18), vertices.get( 7));
		graph.addEdge(edges.get(25), vertices.get(18), vertices.get(15));
		graph.addEdge(edges.get(27), vertices.get(18), vertices.get(10));




adjacencies now: (w/o empty)

V0=[E0, E12]
V2=[E0, E8, E16, E3, E21]
V5=[E19, E6, E14, E10, E5]
V6=[E7, E8]
V7=[E24, E21, E9]
V9=[E5, E3, E17]
V10=[E6, E20, E7, E27]
V13=[E9, E18, E10]
V15=[E25, E14]
V16=[E16, E20, E19, E17, E18]
V18=[E27, E12, E24, E25]

--> 11 cannot be removed (doble edge)

11 again included:


		graph.addEdge(edges.get( 0), vertices.get( 2), vertices.get( 0));
		graph.addEdge(edges.get( 3), vertices.get( 9), vertices.get( 2));
		graph.addEdge(edges.get( 5), vertices.get( 9), vertices.get( 5));
		graph.addEdge(edges.get( 6), vertices.get( 5), vertices.get(10));
		graph.addEdge(edges.get( 7), vertices.get(10), vertices.get( 6));
		graph.addEdge(edges.get( 8), vertices.get( 6), vertices.get(11));
		graph.addEdge(edges.get( 9), vertices.get( 7), vertices.get(13));
		graph.addEdge(edges.get(10), vertices.get(13), vertices.get( 5));
		graph.addEdge(edges.get(11), vertices.get(11), vertices.get( 2));
		graph.addEdge(edges.get(12), vertices.get(18), vertices.get( 0));
		graph.addEdge(edges.get(14), vertices.get(15), vertices.get( 5));
		graph.addEdge(edges.get(15), vertices.get( 6), vertices.get( 2));
		graph.addEdge(edges.get(16), vertices.get(16), vertices.get( 2));
		graph.addEdge(edges.get(17), vertices.get(16), vertices.get( 9));
		graph.addEdge(edges.get(18), vertices.get(16), vertices.get(13));
		graph.addEdge(edges.get(19), vertices.get(16), vertices.get( 5));
		graph.addEdge(edges.get(20), vertices.get(16), vertices.get(10));
		graph.addEdge(edges.get(21), vertices.get( 7), vertices.get( 2));
		graph.addEdge(edges.get(24), vertices.get(18), vertices.get( 7));
		graph.addEdge(edges.get(25), vertices.get(18), vertices.get(15));
		graph.addEdge(edges.get(27), vertices.get(18), vertices.get(10));


adjacencies now: (w/o empty)

V0=[E0, E12]
V2=[E0, E15, E16, E3, E21, E11]
V5=[E19, E6, E14, E10, E5]
V6=[E7, E15, E8]
V7=[E24, E21, E9]
V9=[E5, E3, E17]
V10=[E6, E20, E7, E27]
V11=[E8, E11]
V13=[E9, E18, E10]
V15=[E25, E14]
V16=[E16, E20, E19, E17, E18]
V18=[E27, E12, E24, E25]

--> v0 cant be removed

renaming:

V0=0
V2=1
V5=2
V6=3
V7=4
V9=5
V10=6
V11=7
V13=8
V15=9
V16=10 --> XXXXX
V18=11 --> 10

16 can't be renmed to a smaller number? WTF?

adjacencies now:

V0=[E0, E9]
V1=[E0, E11, E12, E1, E17, E8]
V2=[E15, E3, E10, E7, E2]
V3=[E4, E11, E5]
V4=[E18, E17, E6]
V5=[E2, E1, E13]
V6=[E3, E16, E4, E20]
V7=[E5, E8]
V8=[E6, E14, E7]
V9=[E19, E10]
V10=[E20, E9, E18, E19]
V11=[]
V12=[]
V13=[]
V14=[]
V15=[]
V16=[E12, E16, E15, E13, E14]}

trying to rename edges so V16 is  with E0-E5 instead yields nothing.


Kuratowski: partition 6/5/8,4,9,10 vs 0,1,3,7/16/2 -> not planar