AI Chat AI Image Generator AI Video Text to Speech

Subcubic planar graphs of girth 7 are class I

08/13/2021

∙

by Sebastien Bonduelle, et al.

∙

∙

We prove that planar graphs of maximum degree 3 and of girth at least 7 are 3-edge-colorable, extending the previous result for girth at least 8 by Kronk, Radlowski, and Franen from 1974.

Sebastien Bonduelle
1 publication
František Kardoš
2 publications

page 1

page 2

page 3

page 4

research

∙ 01/15/2020

1-planar graphs with minimum degree at least 3 have bounded girth

We show that every 1-planar graph with minimum degree at least 4 has gir...

0 Francois Dross, et al. ∙

research

∙ 06/29/2022

RAC Drawings of Graphs with Low Degree

Motivated by cognitive experiments providing evidence that large crossin...

0 Patrizio Angelini, et al. ∙

research

∙ 02/09/2023

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs

We present an O(log k)-approximation for both the edge-weighted and node...

0 Zachary Friggstad, et al. ∙

research

∙ 06/06/2023

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs

In this paper we deal with the problem of computing the exact crossing n...

0 Petr Hliněný, et al. ∙

research

∙ 05/06/2018

Tree-like distance colouring for planar graphs of sufficient girth

Given a multigraph G and a positive integer t, the distance-t chromatic ...

0 Ross J. Kang, et al. ∙

research

∙ 04/05/2020

Macroscopic network circulation for planar graphs

The analysis of networks, aimed at suitably defined functionality, often...

0 Fariba Ariaei, et al. ∙

research

∙ 08/27/2018

Kinetostatic analysis and solution classification of a class of planar tensegrity mechanisms

Tensegrity mechanisms are composed of rigid and tensile parts that are i...

0 Philippe Wenger, et al. ∙