scholarly journals Bounds on metric dimensions of graphs with edge disjoint cycles

2021 ◽  
Vol 396 ◽  
pp. 125908
Author(s):  
Jelena Sedlar ◽  
Riste Škrekovski
Keyword(s):  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Metric Dimensions

scholarly journals Mixed metric dimension of graphs with edge disjoint cycles

2021 ◽  
Vol 300 ◽  
pp. 1-8
Author(s):  
Jelena Sedlar ◽  
Riste Škrekovski
Keyword(s):  
Metric Dimension ◽  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Mixed Metric

scholarly journals Packing edge-disjoint cycles in graphs and the cyclomatic number

2010 ◽  
Vol 310 (9) ◽  
pp. 1456-1462 ◽  
Author(s):  
Jochen Harant ◽  
Dieter Rautenbach ◽  
Peter Recht ◽  
Friedrich Regen
Keyword(s):  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Cyclomatic Number

Edge disjoint cycles in graphs

1989 ◽  
Vol 13 (3) ◽  
pp. 313-322 ◽  
Author(s):  
Li Hao
Keyword(s):  
Edge Disjoint ◽  
Disjoint Cycles

ON DISJOINT CYCLES

1994 ◽  
Vol 05 (01) ◽  
pp. 59-68 ◽  
Author(s):  
HANS L. BODLAENDER
Keyword(s):  
Feedback Vertex Set ◽  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Vertex Set ◽  
Test Algorithm ◽  
Vertex Disjoint

It is shown, that for each constant k≥1, the following problems can be solved in [Formula: see text] time: given a graph G, determine whether G has k vertex disjoint cycles, determine whether G has k edge disjoint cycles, determine whether G has a feedback vertex set of size ≤k. Also, every class [Formula: see text], that is closed under minor taking, taking, and that does not contain the graph consisting of k disjoint copies of K3, has an [Formula: see text] membership test algorithm.

scholarly journals On Edge-Disjoint Cycles in a Graph

1964 ◽  
Vol 7 (4) ◽  
pp. 519-523 ◽  
Author(s):  
J. W. Moon
Keyword(s):  
Planar Graphs ◽  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Multiple Edges

Let g(k) denote the least integer such that every graph , with n vertices and n+g(k) edges, contains at least k edge-disjoint cycles; let h(k) be similarly defined for planar graphs. Loops and multiple edges (i.e., cycles of length one and two) are permitted in both cases.

Edge-disjoint cycles in regular directed graphs

1996 ◽  
Vol 22 (3) ◽  
pp. 231-237 ◽  
Author(s):  
Noga Alon ◽  
Colin McDiarmid ◽  
Michael Molloy
Keyword(s):  
Directed Graphs ◽  
Edge Disjoint ◽  
Disjoint Cycles
Sign in / Sign up

Export Citation Format

Share Document