Restricted triangulation on circulant graphs

DOI10.1515/MATH-2018-0033MaRDI QIDQ1644872zbMATH OpenOpenAlexWikidataFDO

Authors N. A. Ali, Hazim Michman Trao, Adem Kilicman

Publication date 22 June 2018

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/math-2018-0033

zbMATH Keywords

triangulationcirculant graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Finding induced cycles within circulant graphs
• Triangles with restricted degrees of their boundary vertices in plane triangulations
• Restricted matching in plane triangulations and near triangulations
• Further notes on: Largest triangle-free subgraphs in powers of cycles
• Embedding a triangular graph within a given boundary

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Edge-removal and non-crossing configurations in geometric graphs
• Noncrossing Hamiltonian paths in geometric graphs
• On the metric dimension of circulant graphs
• Perfect state transfer in integral circulant graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The Pfaffian property of circulant graphs

Cited in

(2)

• Restricted frame graphs and a conjecture of Scott
• Restricted delaunay triangulations and normal cycle

This page was built for publication: Restricted triangulation on circulant graphs

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