Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
AbstractIt is shown that the edges of a bridgeless graph G can be covered with cycles such that the ...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
AbstractFor c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
AbstractFor c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k ...
AbstractGeneralizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
AbstractWe determine bounds for the smallest f(n) such that every mediate graph with n vertices cont...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
AbstractIt is shown that the edges of a bridgeless graph G can be covered with cycles such that the ...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
AbstractFor c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
AbstractFor c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k ...
AbstractGeneralizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
AbstractWe determine bounds for the smallest f(n) such that every mediate graph with n vertices cont...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
International audienceIt is shown that the edges of a bridgeless graph G can be covered with cycles ...
AbstractIt is shown that the edges of a bridgeless graph G can be covered with cycles such that the ...
DOI
Add to ORKG