X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
[formula omitted]-critical graph (1) 1
[formula omitted]-insensitive graph (1) 1
critical graph (1) 1
domination number (1) 1
edge removing (1) 1
edge subdividing (1) 1
efficient graph (1) 1
gamma-critical graph (1) 1
gamma-insensitive graph (1) 1
graphs (1) 1
mathematics, applied (1) 1
tree (1) 1
vizing's conjecture (1) 1
vizing’s conjecture (1) 1
γ-insensitive graph (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 06/2019, Volume 263, pp. 212 - 219
Let e be an edge of a connected simple graph G. The graph obtained by removing (resp. subdividing) an edge e from G is denoted by G−e (resp. Ge). As usual,... 
[formula omitted]-critical graph | Domination number | Tree | [formula omitted]-insensitive graph | Edge removing | Efficient graph | Edge subdividing | Vizing’s Conjecture | Vizing's Conjecture | γ-insensitive graph | critical graph | MATHEMATICS, APPLIED | gamma(sd)-critical graph | gamma-insensitive graph | Graphs
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.