AI Chat AI Image Generator AI Video Text to Speech

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count

08/17/2017

∙

by David Eppstein, et al.

∙

∙

We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D=Ω(√(n)), and at most (2n-Ω(√(n)),2n-D-2) edges.

research

∙ 12/08/2022

Triangle-free projective-planar graphs with diameter two: domination and characterization

In 1975, Plesník characterized all triangle-free planar graphs as having...

0 Dibyayan Chakraborty, et al. ∙

research

∙ 02/25/2020

Coloring triangle-free L-graphs with O(loglog n) colors

It is proved that triangle-free intersection graphs of n L-shapes in the...

0 Bartosz Walczak, et al. ∙

research

∙ 04/04/2023

Constructing extremal triangle-free graphs using integer programming

The maximum number of edges in a graph with matching number m and maximu...

0 Ali Erdem Banak, et al. ∙

research

∙ 12/04/2018

Colouring triangle-free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough r...

0 Ewan Davies, et al. ∙

research

∙ 07/16/2021

On Vizing's edge colouring question

Soon after his 1964 seminal paper on edge colouring, Vizing asked the fo...

0 Marthe Bonamy, et al. ∙

research

∙ 12/31/2020

A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs – via half-edges

We consider three variants of the problem of finding a maximum weight re...

0 Katarzyna Paluch, et al. ∙

research

∙ 03/24/2018

On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices

Researchers developing implementations of distributed graph analytic alg...

0 Geoffrey Sanders, et al. ∙