A Characterization of DFS Cotree Critical Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45848-4_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Coloring Signed Graphs Using DFS

Optimization Letters
ControlOptimization
2015English

A Characterization of Weakly Bipartite Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

On a Characterization of Planar Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1981English

A Characterization of Lattice-Ordered Graphs

English

A New Characterization of Trivially Perfect Graphs

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2015English

Isolated Cycles of Critical Random Graphs

2017English

Strong Products Ofϰ-Critical Graphs

Aequationes Mathematicae
CombinatoricsMathematicsApplied MathematicsDiscrete Mathematics
1993English

Point Arboricity Critical Graphs Exist

Journal of the London Mathematical Society
Mathematics
1975English

The Largest Component in Critical Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy