Reducing prime graphs and recognizing circle graphs
From MaRDI portal
Publication:1116953
DOI10.1007/BF02579301zbMath0666.05037OpenAlexW2015381896MaRDI QIDQ1116953
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579301
Related Items
Isotropic matroids. III: Connectivity ⋮ Minimally 3-connected isotropic systems ⋮ FO model checking on geometric graphs ⋮ On edge transitivity of directed graphs ⋮ Isotropic systems ⋮ Topology and counting of real algebraic curves ⋮ Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs ⋮ Covering and coloring polygon-circle graphs ⋮ Notes on a theorem of Naji ⋮ 2-nested matrices: towards understanding the structure of circle graphs ⋮ A proof of a circle graph characterization ⋮ Graphic presentations of isotropic systems ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Contact Representations of Planar Graphs: Extending a Partial Representation is Hard ⋮ On polygon numbers of circle graphs and distance hereditary graphs ⋮ The complexity of colouring circle graphs ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Interlacement and activities in delta-matroids ⋮ Circle graph isomorphism in almost linear time ⋮ A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Counting hexagonal patches and independent sets in circle graphs ⋮ Prime vertex-minors of a prime graph ⋮ Digraph Decompositions and Eulerian Systems ⋮ Partial characterizations of circle graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Practical and efficient circle graph recognition ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ On the linear algebra of local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Mutant knots and intersection graphs ⋮ Weighted Interlace Polynomials ⋮ Circle graphs and monadic second-order logic ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Recognizing locally equivalent graphs ⋮ Thresholds for classes of intersection graphs ⋮ Diamond-free circle graphs are Helly circle ⋮ \(O(m\log n)\) split decomposition of strongly-connected graphs ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ A 2-isomorphism theorem for delta-matroids ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search ⋮ Splitting cubic circle graphs ⋮ Isotropic matroids. II: Circle graphs ⋮ Graph theoretic approach to parallel gene assembly ⋮ Unavoidable vertex-minors in large prime graphs ⋮ Unnamed Item ⋮ Classes and recognition of curve contact graphs ⋮ Circle graphs and the cycle double cover conjecture ⋮ Unnamed Item ⋮ Container ship stowage problem complexity and connection to the coloring of circle graphs ⋮ Digraphs of Bounded Width ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs ⋮ On a Hopf algebra in graph theory ⋮ The Pure Prime Circle Orbit Conjecture ⋮ Rank connectivity and pivot-minors of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of circle graphs
- Reconnaissance des graphes de cordes
- Isotropic systems
- Graphic presentations of isotropic systems
- Decomposition of Directed Graphs
- Recognizing circle graphs in polynomial time
- Connectivity in Matroids
- Lectures on matroids
