Two Classes of Simple MCD Graphs

DOI10.1007/978-3-540-70666-3_19zbMATH Open1149.05316OpenAlexW1591685386MaRDI QIDQ3595440FDOQ3595440

Authors: Yongbing Shi, Hua Tang, Ling-Liu Gong, Li Xu, Yincai Tang 

Publication date: 28 August 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70666-3_19

Recommendations

• scientific article; zbMATH DE number 279646
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)
• A class of almost uniquely pancyclic graphs
• The number of edges in a maximum cycle-distributed graph

Mathematics Subject Classification ID

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

Cited In (3)

• An old problem of Erdős: a graph without two cycles of the same length
• On the simplicity of the coded path of the code \((i)\)
• On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)

This page was built for publication: Two Classes of Simple MCD Graphs

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