On the first-order edge tenacity of a graph
From MaRDI portal
Publication:266912
DOI10.1016/j.dam.2015.10.027zbMath1333.05083OpenAlexW2274961282MaRDI QIDQ266912
Amin Ghodousian, Dara Moazzami, Bahareh Bafandeh
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.027
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tenacity of a graph with maximum connectivity
- Some results related to the tenacity and existence of \(k\)-trees
- Tenacity of complete graph products and grids
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Onq-trees
- Edge‐tenacious networks
- On the edge-tenacity of the middle graph of a graph
- Decomposition of Finite Graphs Into Forests
This page was built for publication: On the first-order edge tenacity of a graph