6533b829fe1ef96bd1289bc6
RESEARCH PRODUCT
Underlying Simple Graphs
Sebastian Kochsubject
Theoretical computer scienceApplied Mathematics020207 software engineering0102 computer and information sciences02 engineering and technology68t9901 natural sciencesComputational Mathematics03b35010201 computation theory & mathematicsSimple (abstract algebra)underlying simple graphQA1-9390202 electrical engineering electronic engineering information engineering05c76Graph operationsgraph operationsMathematicsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsdescription
Summary In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2019-10-01 | Formalized Mathematics |