Birational equivalence of reduced graphs
type: Item
instance of: scholarly article
title: Birational equivalence of reduced graphs
zbMATH Open document ID: 0892.05020
DOI: 10.1016/S0022-4049(96)00100-4
published in: Journal of Pure and Applied Algebra
publication date: 1998-07-21T00:00:00Z
review text: Reduced graphs representing antisymmetric digraphs are investigated. The author gives an arithmetical characterization of these graphs using sequences of natural numbers representing a partial ordering by its maximal chains. For such graphs, methods similar to those used in birational geometry are defined. A class of equivalent graphs is studied and a canonical graph with a minimum number of points in the class is characterized.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 14E05
Mathematics Subject Classification ID: 14E15
zbMATH DE Number: 1121651
zbMATH Keywords: reduced graphs
zbMATH Keywords: antisymmetric digraphs
zbMATH Keywords: equivalent graphs
author: C. Marijuán
reviewed by: David P. Brown
MaRDI profile type: MaRDI publication profile
cites work: On the computer enumeration of finite topologies
cites work: Q4143433
cites work: Resolution of singularities of an algebraic variety over a field of characteristic zero. I
cites work: Q4865913
cites work: Constructiveness of Hironaka's resolution
cites work: Q4865916
Recommended article: On reversal of graph orientation
Recommended article: On the characterization of digraphs with given rank
Recommended article: Q4251039
Recommended article: Q3991018
Recommended article: Largest non-unique subgraphs
description: scientific article; zbMATH DE number 1121651