Further results on the total monochromatic connectivity of graphs
From MaRDI portal
Publication:2168754
DOI10.1007/S10878-022-00850-5zbMATH Open1498.05149OpenAlexW4213436003MaRDI QIDQ2168754FDOQ2168754
Ping Li, Xueliang Li, Yanhong Gao
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00850-5
Recommendations
Nordhaus-Gaddum-type resultedge vertex monochromatic connection numbertotal monochromatic connection coloring number
Cites Work
- Graph theory
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning Trees with Many Leaves
- Connected Domination and Spanning Trees with Many Leaves
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A greedy approximation for minimum connected dominating sets
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- Spanning trees with many leaves
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
- Spanning trees with many leaves and average distance
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Colorful monochromatic connectivity
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- Title not available (Why is that?)
- The (vertex-)monochromatic index of a graph
- Total monochromatic connection of graphs
- More on total monochromatic connection of graphs
Cited In (1)
This page was built for publication: Further results on the total monochromatic connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168754)
