scientific article; zbMATH DE number 1208724
From MaRDI portal
Publication:4211751
zbMATH Open0906.05035MaRDI QIDQ4211751FDOQ4211751
Authors: Gary Chartrand, Heather Jordon, Robert C. Vandell, Frank Harary 
Publication date: 7 October 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (24)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lower and upper forcing geodetic numbers of block--cactus graphs
- THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH
- Bounds on the forcing domination number of graphs
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- Title not available (Why is that?)
- Complete forcing numbers of complete and almost-complete multipartite graphs
- On the computational complexity of defining sets
- The forcing vertex detour monophonic number of a graph
- The \((a,b)\)-forcing geodetic graphs
- The forcing hull and forcing geodetic numbers of graphs
- Forcing super domination number of a graph
- On the forcing domination and the forcing total domination numbers of a graph
- Research problems from the 19th British Combinatorial Conference
- Title not available (Why is that?)
- Forcing domination numbers of graphs under some binary operations
- Title not available (Why is that?)
- The restrained geodetic number of a graph
- The forcing geodetic global domination number of a graph
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- The forcing nonsplit domination number of a graph
- On the forcing connected domination number of a graph
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
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 Q4211751)
