scientific article; zbMATH DE number 3575605
From MaRDI portal
Publication:4147995
Cited in
(25)- Cycles in the complement of a tree or other graph
- Fault diameter of interconnection networks
- All Ramsey numbers for five vertices and seven or eight edges
- Hamiltonicity and combinatorial polyhedra
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph
- On the relations between arboricity and independent number or covering number
- A graph approximation heuristic for the vertex cover problem on planar graphs
- A bibliography on chromatic polynomials
- A result on the 3-generalized connectivity of a graph and its line graph
- What is reconstruction for ordered sets?
- Computers and discovery in algebraic graph theory
- Optimal control of multiclass parallel service systems
- On the complexity of reconstructing chemical reaction networks
- ON α,β DESTRUCTIBLE GRAPHS
- Weak integer additive set-labeled graphs: a creative review
- Graphs with prescribed connectivity and line graph connectivity
- A class of exceptional bernstein algebras associated to graphs1
- A review on graceful and sequential integer additive set-labeled graphs
- On some aspects of the generalized Petersen graph
- Realizability problem of distance-edge-monitoring numbers
- On bandwidth for the tensor product of paths and cycles
- The role of counterexamples in understanding the closed graph and composition theorems
- Gain total graphs and their spectra via G-phases and group representations
- Generalizing the generalized Petersen graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
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 Q4147995)
