scientific article; zbMATH DE number 7090175
From MaRDI portal
Publication:5228101
zbMath1438.01005MaRDI QIDQ5228101
Publication date: 9 August 2019
Full work available at URL: http://www.dmlett.com/archive/DML19_v1_p.8392.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
- The sigma chromatic number of a graph
- Variations on a theorem of Petersen
- The ubiquitous Petersen graph
- Subgraph distances in graphs defined by edge transfers
- Stratification and domination in graphs
- Resolvability in graphs and the metric dimension of a graph
- The convexity number of a graph
- Rainbow disconnection in graphs
- Another view of bipartite Ramsey numbers
- Hamiltonian colorings of graphs
- Boundary vertices in graphs
- Stars and their \(k\)-Ramsey numbers
- Graphs with forbidden subgraphs
- On the geodetic number of a graph
- The rainbow connectivity of a graph
- Rainbow trees in graphs and generalized connectivity
- How to Define an Irregular Graph
- Rainbow connection in graphs
- Edge rotations and distance between graphs
- Highly irregular graphs
- Steiner distance in graphs
- Geodetic sets in graphs
- The existence of complete cycles in repeated line-graphs
- A Characterization of Certain Ptolemaic Graphs
- A Graph-Theoretic Approach to a Communications Problem
- The Steiner number of a graph
This page was built for publication: