scientific article; zbMATH DE number 19214

zbMATH Open0752.05033MaRDI QIDQ3976645FDOQ3976645

Authors: Magali M. A. Barroso, Jayme L. Szwarcfiter 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• New clique and independent set algorithms for circle graphs
• Finding maximum cliques on circular-arc graphs
• scientific article; zbMATH DE number 3891419
• Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search

zbMATH Keywords

circle graphmaximal cliqueslocally edge transitive orientations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30)

Cited In (5)

• Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
• On edge transitivity of directed graphs
• The number of circles of a maximum state of a plane graph with applications
• Enumeration aspects of maximal cliques and bicliques
• Title not available (Why is that?)

This page was built for publication:

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