Graphs with the same truncated cycle matroid

09/30/2022
by   Jose De Jesus, et al.
0

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every 3-connected graph, except for K4, is uniquely defined by its truncated cycle matroid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2020

Fast recognition of some parametric graph families

We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle...
research
07/26/2018

A new proof of Grinberg Theorem based on cycle bases

Grinberg Theorem, a necessary condition only for planar Hamiltonian grap...
research
08/01/2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

A graph is H-free if it contains no induced subgraph isomorphic to H. We...
research
11/21/2022

Treedepth vs circumference

The circumference of a graph G is the length of a longest cycle in G, or...
research
08/27/2021

From Pivots to Graphs: Augmented CycleDensity as a Generalization to One Time InverseConsultation

This paper describes an approach used to generate new translations using...
research
05/17/2022

The Hamilton compression of highly symmetric graphs

We say that a Hamilton cycle C=(x_1,…,x_n) in a graph G is k-symmetric, ...
research
05/23/2017

Unbiasing Truncated Backpropagation Through Time

Truncated Backpropagation Through Time (truncated BPTT) is a widespread ...

Please sign up or login with your details

Forgot password? Click here to reset