Disimplicial arcs, transitive vertices, and disimplicial eliminations

MaRDI QIDQ3455034zbMATH OpenFDO

Authors Martiniano Roberto Eguía, Francisco J. Soulignac

Publication date 3 December 2015

Full work available at URL https://arxiv.org/abs/1403.1628, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2687/0.html

zbMATH Keywords

bisimplicial edges of bipartite graphsbisimplicial elimination schemesDedekind digraphsdiclique irreducible digraphsdisimplicial arcsdisimplicial elimination schemestransitive digraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Algorithmic aspects of bipartite graphs
• Transitivity on subclasses of bipartite graphs
• An infinite family of self-diclique digraphs
• Complexité de problèmes liés aux graphes sans circuit
• On the semi-perfect elimination

This page was built for publication: Disimplicial arcs, transitive vertices, and disimplicial eliminations

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