Search results
From MaRDI portal
- for continuous random energy models 2020-05-04 Paper Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs 2020-04-07 Paper Branching Brownian...10 bytes (19 words) - 16:46, 10 December 2023
- with a universal vertex I: An asymptotic result 2023-10-09 Paper Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result...10 bytes (19 words) - 03:26, 9 December 2023
- variant of the Erdős‐Sós conjecture 2020-05-21 Paper Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs 2020-04-07 Paper Cooperative colorings...10 bytes (16 words) - 20:15, 8 December 2023
- 2018-12-20 Paper On the Erdős-Hajnal conjecture for six-vertex tournaments 2018-11-15 Paper Vertex-minors and the Erdős-Hajnal conjecture 2018-10-23 Paper...10 bytes (17 words) - 18:15, 6 October 2023
- for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path 2023-10-04 Paper Erdős–Hajnal for graphs with no 5‐hole 2023-09-20...10 bytes (19 words) - 23:39, 9 December 2023
- org/abs/1909.10967 zbMATH Keywords induced subgraph; even-hole-free graph; bisimplicial vertex Mathematics Subject Classification ID 05C38: Paths and cycles 05C75:...15 bytes (83 words) - 17:15, 25 April 2024
- zbMATH Keywords decomposition; vertex coloring; structure; recognition algorithm; clique cutsets; 2-amalgams; bisimplicial cutsets Mathematics Subject Classification...15 bytes (71 words) - 16:27, 7 February 2024
- problem; 1-perfectly orientable graph; LBFS; avoidable edge; avoidable vertex; bisimplicial elimination ordering Mathematics Subject Classification ID 68R10:...15 bytes (98 words) - 21:08, 1 February 2024
