One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
type: Item
instance of: scholarly article
title: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
zbMATH Open document ID: 1023.05085
author: Ken-ichi Kawarabayashi
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1843799
MaRDI profile type: Publication
full work available at URL: jctb.2001.2059
OpenAlex ID: W2091441627
cites work: Q3941433
cites work: Cycles through specified vertices of a graph
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: Any four independent edges of a 4-connected graph are contained in a circuit
cites work: Circuits through specified edges
cites work: Cycles Through Prescribed and Forbidden Point Sets
cites work: A nine point theorem for 3-connected graphs
cites work: Cycles intersecting a prescribed vertex set
cites work: Cycles through a prescribed vertex set in \(n\)-connected graphs.
cites work: Q3972952
cites work: On circuits through five edges
cites work: Note on circuits containing specified edges
cites work: Circuits containing specified edges
cites work: The binding number of a graph and its Anderson number
DOI: 10.1006/JCTB.2001.2059
description: scientific article; zbMATH DE number 1843799