Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH6-Conjecture

DOI10.1002/jgt.21763zbMath1296.05132arXiv1302.0404OpenAlexW2145635208WikidataQ122962784 ScholiaQ122962784MaRDI QIDQ5495885

Maria Chudnovsky, Peter Maceli

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

pathinduced subgraphantipath

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Graphs with No Induced Five‐Vertex Path or Antipath ⋮ The Erdős-Hajnal conjecture for paths and antipaths

Cites Work

• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• On a property of the class of n-colorable graphs
• Growing Without Cloning
• On brittle graphs
• Some classes of perfectly orderable graphs

This page was built for publication: Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH₆-Conjecture