Recognition of perfect elimination bipartite graphs

DOI10.1016/0020-0190(82)90101-6zbMATH Open0505.68030OpenAlexW2077329883MaRDI QIDQ1836480FDOQ1836480

Authors: Yanyan Li 

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90101-6

zbMATH Keywords

sparse matricesbipartite graphsrecognition algorithmbisimplicial edge

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Toward Characterization of Perfect Elimination Digraphs
• An algorithm for testing chordality of graphs

Cited In (6)

• Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
• Recognizing quasi-triangulated graphs.
• Bisimplicial edges in bipartite graphs
• Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
• Recognizing sparse perfect elimination bipartite graphs
• A note on perfect partial elimination

This page was built for publication: Recognition of perfect elimination bipartite graphs

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