Reconnaissance des graphes de cordes

DOI10.1016/0012-365X(85)90117-7zbMATH Open0567.05033MaRDI QIDQ1059643FDOQ1059643

Authors: Walid Naji 

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Publication:4724662
• scientific article; zbMATH DE number 3970805
• scientific article
• Recognizing circle graphs in polynomial time
• Practical and efficient circle graph recognition

zbMATH Keywords

chordsorientationcircle graphdouble labelling

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites Work

• Graph theory
• Title not available (Why is that?)
• A characterization of circle graphs
• Title not available (Why is that?)

Cited In (31)

• Characterizing graphic matroids by a system of linear equations
• Unavoidable vertex-minors in large prime graphs
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• Graphes de cordes et espaces graphiques
• Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
• A characterization of circle graphs in terms of multimatroid representations
• On edge transitivity of directed graphs
• Splitting cubic circle graphs
• Cyclic orders
• A proof of a circle graph characterization
• Title not available (Why is that?)
• 2-nested matrices: towards understanding the structure of circle graphs
• A characterization of unimodular orientations of simple graphs
• Notes on a theorem of Naji
• Practical and efficient circle graph recognition
• A characterization of circle graphs
• Partial characterizations of circle graphs
• Isotropic matroids. II: Circle graphs
• The combinatorics of a tree-like functional equation for connected chord diagrams
• Unimodularity and circle graphs
• Diamond-free circle graphs are Helly circle
• Bipartite complements of circle graphs
• Reducing prime graphs and recognizing circle graphs
• Bipartite graphs that are not circle graphs
• The complexity of colouring circle graphs (extended abstract)
• Intersection graphs of rays and grounded segments
• The number of quasi-trees in fans and wheels
• Title not available (Why is that?)
• Digraph Decompositions and Eulerian Systems
• Forbidden induced subgraph characterization of circle graphs within split graphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Reconnaissance des graphes de cordes

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