Characterization and enumeration of 3-regular permutation graphs

DOI10.1216/RMJ.2025.55.89MaRDI QIDQ6977132zbMATH OpenFDO

Authors Aysel Erey, Zachary Gershkoff, Amanda Lohss, Ranjan Rohatgi

Publication date 30 May 2025

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/rocky-mountain-journal-of-mathematics/volume-55/issue-1/CHARACTERIZATION-AND-ENUMERATION-OF-3-REGULAR-PERMUTATION-GRAPHS/10.1216/rmj.2025.55.89.full

zbMATH Keywords

permutation graphgraph regularity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Bounding the number of edges in permutation graphs
• Circular permutation graphs
• Connected permutation graphs
• Determination of permutation graphs
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• On Comparability and Permutation Graphs
• On random trees obtained from permutation graphs
• Seidel minor, permutation graphs and combinatorial properties
• The fractional metric dimension of permutation graphs
• Transitiv orientierbare Graphen
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Characterization and enumeration of 3-regular permutation graphs

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