Constructive graph labeling using double cosets

DOI10.1016/S0012-365X(74)80015-4zbMATH Open0273.05002MaRDI QIDQ2264765FDOQ2264765

Authors: Harold Brown, Larry Hjelmeland, Larry Masinter 

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Permutational isomers on a molecular skeleton with neighbor-excluding ligands
• An algorithm for the construction of the graphs of organic molecules
• Pruning the search tree in the constructive enumeration of molecular graphs
• Construction of discrete structures, especially isomers
• Computer generation of vertex graphs
• Subcomplete generalizations of graph isomorphism

This page was built for publication: Constructive graph labeling using double cosets

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