Splitting cubic circle graphs

DOI10.7151/dmgt.1894zbMath1339.05327arXiv1504.01143OpenAlexW3101467810MaRDI QIDQ726651

Lorenzo Traldi

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01143

zbMATH Keywords

regular graphcircle graphsplit decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

2-nested matrices: towards understanding the structure of circle graphs ⋮ Isotropic matroids. II: Circle graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical and efficient circle graph recognition
• Practical and efficient split decomposition via graph-labelled trees
• Partial characterizations of circle graphs
• Circle graphs and monadic second-order logic
• Diamond-free circle graphs are Helly circle
• Reconnaissance des graphes de cordes
• Reducing prime graphs and recognizing circle graphs
• Cycle decomposition by disjoint transpositions
• Circle graph obstructions
• Decomposition of Directed Graphs
• Recognition of Circle Graphs

This page was built for publication: Splitting cubic circle graphs