4 citations · 6 across the 4 of their papers we have counts for
4 papers
On essentially 4-edge-connected cubic bricks
Nishad Kothari, Marcelo H. de Carvalho, Cláudio L. Lucchesi +1
Lovász (1987) proved that every matching covered graph may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let denote the number o…
Even circuits of prescribed clockwise parity
Ilse Fischer, C. H. C. Little
We show that a graph has an orientation under which every circuit of even length is clockwise odd if and only if the graph contains no subgraph which is, after the contraction of a…
A characterisation of Pfaffian near bipartite graphs
Ilse Fischer, C. H. C. Little
In 1967 Kasteleyn introduced a powerful method for enumerating the 1-factors of planar graphs. In fact his method can be extended to graphs which permit an orientation under which…
Towards a characterisation of Pfaffian graphs
Charles H. C. Little, Franz Rendl, Ilse Fischer
A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of such that contains a 1-factor. However a general characte…