Cyclability in graph classes (Q833007)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Cyclability in graph classes	scientific article

Statements

scholarly article

0 references

Cyclability in graph classes (English)

0 references

Christophe Crespelle

0 references

Petr A. Golovach

0 references

Discrete Applied Mathematics

0 references

publication date

28 March 2022

0 references

zbMATH Keywords

cyclability

0 references

interval graphs

0 references

bipartite permutation graphs

0 references

cographs

0 references

certifying algorithms

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2022.01.021

0 references

0 references

A framework for the verification of certifying computations

0 references

0 references

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

0 references

0 references

Graph Classes: A Survey

0 references

Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

0 references

Deferred-query: An efficient approach for some problems on interval graphs

0 references

Tough graphs and Hamiltonian circuits.

0 references

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

0 references

Complement reducible graphs

0 references

Parameterized Algorithms

0 references

Paths in interval graphs and circular arc graphs

0 references

Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

0 references

1-tough cocomparability graphs are hamiltonian

0 references

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

0 references

In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

0 references

0 references

The Planar Hamiltonian Circuit Problem is NP-Complete

0 references

The Parameterized Complexity of Graph Cyclability

0 references

Algorithmic graph theory and perfect graphs

0 references

A look at cycles containing specified elements of a graph

0 references

The Hamiltonian problem on distance-hereditary graphs

0 references

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

0 references

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs

0 references

On a class of posets and the corresponding comparability graphs

0 references

Finding Hamiltonian circuits in interval graphs

0 references

Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits

0 references

An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals

0 references

Certifying algorithms

0 references

HAMILTONian circuits in chordal bipartite graphs

0 references

Graph minors. XIII: The disjoint paths problem

0 references

Bipartite permutation graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.DAM.2022.01.021

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:833007

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q833007&oldid=38492718"