scientific article; zbMATH DE number 3221976

zbMATH Open0136.44703MaRDI QIDQ5509541FDOQ5509541

Authors: V. G. Vizing 

Publication date: 1965

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (33)

• Some results on domination number of products of graphs
• Graphs with maximum size and given paired-domination number
• Generating hard and diverse test sets for NP-hard graph problems
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
• Sizes and transmissions of digraphs with a given clique number
• Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
• A survey of selected recent results on total domination in graphs
• Efficiency in exponential time for domination-type problems
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Some results on characterizing the edges of connected graphs with a given domination number
• Inverting the Turán problem
• Maximum number of edges in connected graphs with a given domination number
• A generalization of Vizing's theorem on domination
• Bounds on neighborhood total domination number in graphs
• Domination parameters of a graph and its complement
• Domination number and neighbourhood conditions
• Maximum size of digraphs with some parameters
• On the spectral radius of graphs with a given domination number
• Maximum sizes of graphs with given domination parameters
• Graph theory
• Optimal linear‐Vizing relationships for (total) domination in graphs
• On strong (weak) independent sets and vertex coverings of a graph
• Critical concepts in domination
• Paired domination in graphs
• The total coloring of a multigraph with maximal degree 4
• Extremal \(P_4\)-stable graphs
• On 4-edge coloring of cubic graphs containing ``small non-planar subgraphs
• Strong vb-dominating and vb-independent sets of a graph
• Learning bounds via sample width for classifiers on finite metric spaces
• Isolation of \(k\)-cliques. II
• Relating the size of a connected graph to its total and restricted domination numbers
• Monitoring the edges of a graph using distances with given girth

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5509541)