Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Identifying codes in some subgraphs of the square lattice
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Extremal double hexagonal chains with respect to k-matchings and k-independent sets
Discrete Applied Mathematics
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Distance-Related invariants of fasciagraphs and rotagraphs
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
An infinite family of graphs with a facile count of perfect matchings
Discrete Applied Mathematics
| Hi-index | 0.04 |