Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,352,248 papers from all fields of science
Search
Sign In
Create Free Account
Cactus graph
Known as:
Cactus (disambiguation)
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Binary matroid
Combinatorial optimization
Cycle (graph theory)
Cycle double cover
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Simple Linear Time Algorithm for Computing a 1-Median on Cactus Graphs
K. Nguyen
,
Pham Van Chien
,
Ly Hong Hai
,
Huynh Duc Quoc
2017
Corpus ID: 37713624
We address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the…
Expand
2016
2016
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
H. B. M. Filho
,
R. Machado
,
C. M. H. de Figueiredo
Algorithmica
2016
Corpus ID: 253982090
The class of unichord-free graphs was recently investigated in the context of vertex-colouring (Trotignon and Vušković in J Graph…
Expand
2016
2016
Multiplicative Zagreb indices of cactus graphs
Shaohui Wang
,
B. Wei
2016
Corpus ID: 130647658
Given a graph G, let M(G) and ∏ (G) be Zagreb index and Multiplicative Zagreb index. A connected graph is a cactus graph if and…
Expand
2016
2016
The arithmetical rank of the edge ideals of cactus graphs
M. Barile
,
Antonio Macchia
2016
Corpus ID: 119577042
ABSTRACT We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of…
Expand
2013
2013
Cordial labelling of Cactus Graphs
Nasreen Khan
,
M. Pal
2013
Corpus ID: 124987853
Suppose = ( , ) G V E be a graph with vertex set V and edge set E . A vertex labelling : {0,1} f V → induces an edge labelling…
Expand
2012
2012
( 2 , 1 ) L Labelling of Cactus Graphs
2012
Corpus ID: 59385276
The (2,1) L -labelling of a graph G is an abstraction of assigning integer frequencies to radio transmitters such that the…
Expand
2011
2011
Avalanche dynamics of the Abelian sandpile model on the expanded cactus graph
Gregory Gauthier
2011
Corpus ID: 118181790
We investigate the avalanche dynamics of the abelian sandpile model on arbitrarily large balls of the expanded cactus graph (the…
Expand
2010
2010
AMO-Advanced Modeling and Optimization , Volume 12 , Number 2 , 2010 An Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
Kalyani Das
2010
Corpus ID: 38149741
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to…
Expand
2010
2010
An Optimal Algorithm to Find a Maximum Weight 2- Coloured Set on Cactus Graphs
Kalyani Das
,
M. Pal
,
Purba Medinipur
2010
Corpus ID: 125169400
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to…
Expand
2009
2009
Succinct Greedy Graph Drawing in R 2
M. Goodrich
2009
Corpus ID: 15475977
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE