Reconnaissance des graphes de cordes

DOI10.1016/0012-365X(85)90117-7MaRDI QIDQ1059643zbMATHFDO

Authors Walid Naji

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chordsorientationcircle graphdouble labelling

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3588700 (Why is no real title available?)
• A characterization of circle graphs
• Graph theory

Cited in

(31)

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

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)