- Home
- » Tags
- » Graph property
Top View
- Completeness Results for Graph Isomorphism on Restricted Graph Classes
- From Tree-Decompositions to Clique-Width Terms Bruno Courcelle
- What Is the Furthest Graph from a Hereditary Property?
- General Graph Model
- Arxiv:1910.06037V1 [Math.CO] 14 Oct 2019
- Spectral Graph Theory Due Friday, Week 9 UCSB 2015
- On the Thinness and Proper Thinness of a Graph
- Spectral Graph Theory to Appear in Handbook of Linear Algebra, Second Edition, CCR Press
- A Guide to the Discharging Method
- Generalized Total Colorings of Graphs
- Fractional Q-Edge-Coloring of Graphs
- Diestel: Graph Theory
- Graphs, Their Width, and Logic
- Tree-Depth of Graphs: Characterisations and Obstructions
- Lipics-ESA-2016-51.Pdf (0.5
- Intersection Dimension and Maximum Degree
- Rank-Width of Random Graphs
- 2.4 Graph Properties and the Induced Subgraph Problem
- 1. Graph Properties
- Graph Theory
- Three Theorems Regarding Testing Graph Properties*
- Polynomial Graph-Colorings
- 1 Describing Graphs: a First-Order Approach to Graph Canonization
- P4-Free Partition and Cover Numbers and Application
- Hermitian Spectral Theory of Mixed Graphs
- A Property Testing Framework for the Theoretical Expressivity of Graph Kernels
- Clique-Width for Hereditary Graph Classes 2
- Understanding Some Graph Parameters by Infinite Model Theory
- Graph Coloring with Local and Global Constraints
- Shrub-Depth and M-Partite Cographs?
- Connection Matrices and the Definability of Graph Parameters
- Introduction to Testing Graph Properties
- Graph Colorings Under Global Structural Conditions
- Approximating the Spectrum of a Graph Arxiv:1712.01725V1 [Cs.DS] 5 Dec 2017
- Pattern Vectors from Algebraic Graph Theory
- Testable Bounded Degree Graph Properties Are Random Order Streamable
- Multi-Clique-Width∗
- Intersection Dimension and Graph Invariants
- Property Graph Developer's Guide
- Graph Properties
- Discrete Mathematics a Look at Cycles Containing Specified Elements of a Graph
- The Local Geometry of Graphs, Or, How to “Read” Large Graphs
- Space-Time Tradeoffs for Graph Properties
- Planar Graphs — a Recap
- Solving Subgraph Isomorphism Problems with Constraint Programming Stéphane Zampelli, Yves Deville, Christine Solnon
- Graph Theory
- Chapter 5 Reduction Algorithms
- Multicut on Graphs of Bounded Clique-Width∗†
- The Complexity of Generalized Graph Colorings
- Graph Edge Coloring: a Survey
- Certificates for Properties of Stability Polynomials of Graphs
- Graph Decompositions, Parse Trees, and MSO Properties
- II Homework Exercises HOMEWORK 1 219 Homework 1
- Shrub-Depth: Capturing Height of Dense Graphs
- Weakly Distinguishing Graph Polynomials Johann A
- Subgraph Isomorphism Graphs
- Spectra of Graphs
- Cover Graphs and Order Dimension
- New Results on Generalized Graph Coloring
- On the Planar Split Thickness of Graphs∗
- Thresholds for Some Basic Properties Eight Lectures on Random Graphs: Lecture 2
- On the Tree-Depth of Random Graphs✩ G
- Arxiv:2102.00268V2 [Math.CO] 23 May 2021 .Pofo H Elroens Hoe .08 5 3 2 2 Problems Open and References Conclusions Theorem 1.10 Sturm’S Theorem 5
- An Updated Survey on Rainbow Connections of Graphs - a Dynamic Survey Xueliang Li Nankai University, China, [email protected]
- Open Problems in Property Testing of Graphs
- Graph Theory, an Antiprism Graph Is a Graph That Has One of the Antiprisms As Its Skeleton