On the public citation graph
Hadwiger's conjecture forK 6-free graphs
0 signed · 270 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01226465openalex-snapshot
�ber die Maximalzahl kreuzungsfreierH-Wege
inferredcites →https://doi.org/10.1007/bf01350174openalex-snapshot
Eine Verallgemeinerung desn-fachen Zusammenhangs f�r Graphen
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1007/bf02052726openalex-snapshot
Über trennende Eckenmengen in homomorphiekritischen Graphen
inferredcites →https://doi.org/10.1016/0012-365x(80)90158-2openalex-snapshot
Disjoint paths in graphs
inferredcites →https://doi.org/10.1016/0012-365x(89)90205-7openalex-snapshot
Hadwiger's conjecture (k = 6) : Neighbour configurations of 6-vertices in contraction- critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)90604-eopenalex-snapshot
Conjecture de Hadwiger: k = 6. II—réductions de sommets de degré 6 dans les graphes 6- chromatiques contraction-critiques
inferredcites →https://doi.org/10.1016/0095-8956(90)90063-6openalex-snapshot
Graph minors. IX. Disjoint crossed paths
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1145/322203.322207openalex-snapshot
A Polynomial Solution to the Undirected Two Paths Problem
inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-snapshot
Every planar map is four colorable. Part I: Discharging
inferredcites →https://doi.org/10.1215/ijm/1256049012openalex-snapshot
Every planar map is four colorable. Part II: Reducibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
inferred← citeshttps://doi.org/10.1002/jgt.20232openalex-snapshot
Extremal results for rooted minor problems
inferred← citeshttps://doi.org/10.1002/jgt.20268openalex-snapshot
Independence number and clique minors
inferred← citeshttps://doi.org/10.1002/jgt.20272openalex-snapshot
An excluded minor theorem for the Octahedron plus an edge
inferred← citeshttps://doi.org/10.1002/jgt.20321openalex-snapshot
Hadwiger's conjecture for quasi‐line graphs
inferred← citeshttps://doi.org/10.1002/jgt.20360openalex-snapshot
K6‐minors in triangulations and complete quadrangulations
inferred← citeshttps://doi.org/10.1002/jgt.20425openalex-snapshot
An approximate version of Hadwiger's conjecture for claw‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.20447openalex-snapshot
Hadwiger number and chromatic number for near regular degree sequences
inferred← citeshttps://doi.org/10.1002/jgt.21770openalex-snapshot
Constructing Graphs with No Immersion of Large Complete Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21812openalex-snapshot
Finding Minors in Graphs with a Given Path Structure
inferred← citeshttps://doi.org/10.1002/jgt.22007openalex-snapshot
Hadwiger's Conjecture for the Complements of Kneser Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22035openalex-snapshot
Hadwiger's Conjecture for ℓ‐Link Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22056openalex-snapshot
Unique Colorability and Clique Minors
inferred← citeshttps://doi.org/10.1002/jgt.22206openalex-snapshot
Complete graph immersions and minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.22502openalex-snapshot
Graphs with no K9= minor are 10‐colorable
inferred← citeshttps://doi.org/10.1002/jgt.22515openalex-snapshot
The extremal function for K9= minors
inferred← citeshttps://doi.org/10.1002/jgt.70110openalex-snapshot
A Note on Extendable Sets of Colorings and Rooted Minors
inferred← citeshttps://doi.org/10.1002/rsa.21038openalex-snapshot
Clique minors in graphs with a forbidden subgraph
inferred← citeshttps://doi.org/10.1006/jctb.1995.1049openalex-snapshot
An Abstract Generalization of a Map Reduction Theorem of Birkhoff
inferred← citeshttps://doi.org/10.1006/jctb.1995.1056openalex-snapshot
On a Minor-Monotone Graph Invariant
inferred← citeshttps://doi.org/10.1006/jctb.1998.1835openalex-snapshot
Fractional Colouring and Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1006/jctb.1999.1930openalex-snapshot
Clique Minors in Graphs and Their Complements
inferred← citeshttps://doi.org/10.1006/jctb.2000.1962openalex-snapshot
Surfaces, Tree-Width, Clique-Minors, and Partitions
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_40openalex-snapshot
Graph Coloring and the Immersion Order
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_30openalex-snapshot
Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable
inferred← citeshttps://doi.org/10.1007/978-3-030-62497-2_30openalex-snapshot
Notes on Tree- and Path-Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_5openalex-snapshot
Extremal Density for Sparse Minors and Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_14openalex-snapshot
Progress on the Four-Color Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_12openalex-snapshot
Some Conjectures and Questions in Chromatic Topological Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_34openalex-snapshot
Hadwiger’s Conjecture and Squares of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-322-83092-0_2openalex-snapshot
Geometrische Darstellungen von Graphen und der 4-Farbensatz
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_17openalex-snapshot
Extremal Functions for Graph Minors
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_38openalex-snapshot
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
inferred← citeshttps://doi.org/10.1007/s00283-012-9275-2openalex-snapshot
Sketchy Tweets: Ten Minute Conjectures in Graph Theory
inferred← citeshttps://doi.org/10.1007/s00373-006-0684-xopenalex-snapshot
Some Recent Progress and Applications in Graph Minor Theory
inferred← citeshttps://doi.org/10.1007/s00373-008-0795-7openalex-snapshot
Hadwiger Number and the Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1297-9openalex-snapshot
On Group Choosability of Graphs, II
inferred← citeshttps://doi.org/10.1007/s00373-015-1611-9openalex-snapshot
Excluded-Minor Characterization of Apex-Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02012-7openalex-snapshot
Rooted Complete Minors in Line Graphs with a Kempe Coloring
inferred← citeshttps://doi.org/10.1007/s00373-020-02218-0openalex-snapshot
In Memoriam Professor Robin Thomas (1962—2020)
inferred← citeshttps://doi.org/10.1007/s00373-025-02899-5openalex-snapshot
Improved Bound for Hadwiger’s Conjecture
inferred← citeshttps://doi.org/10.1007/s00454-012-9413-9openalex-snapshot
Linkless and Flat Embeddings in 3-Space
inferred← citeshttps://doi.org/10.1007/s00493-005-0019-1openalex-snapshot
Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
inferred← citeshttps://doi.org/10.1007/s00493-007-2169-9openalex-snapshot
Complete partitions of graphs
inferred← citeshttps://doi.org/10.1007/s00493-007-2213-9openalex-snapshot
Some remarks on the odd hadwiger’s conjecture
inferred← citeshttps://doi.org/10.1007/s00493-014-2806-zopenalex-snapshot
A minimum degree condition forcing complete graph immersion
inferred← citeshttps://doi.org/10.1007/s00493-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
inferred← citeshttps://doi.org/10.1007/s00493-019-3848-zopenalex-snapshot
Clustered Colouring in Minor-Closed Classes
inferred← citeshttps://doi.org/10.1007/s00493-024-00081-8openalex-snapshot
Defective Coloring is Perfect for Minors
inferred← citeshttps://doi.org/10.1007/s10958-018-3853-6openalex-snapshot
On the Connection Between the Chromatic Number of a Graph and the Number of Cycles Covering a Vertex or an Edge
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
inferred← citeshttps://doi.org/10.1016/j.aam.2023.102489openalex-snapshot
Phase transition of degeneracy in minor-closed families
inferred← citeshttps://doi.org/10.1016/j.aim.2023.109020openalex-snapshot
Breaking the degeneracy barrier for coloring graphs with no K minor
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.015openalex-snapshot
List-coloring graphs without K4,k -minors
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.022openalex-snapshot
Dynamic coloring of graphs having no K5 minor
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.017openalex-snapshot
The high order spectral extremal results for graphs and their applications
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.014openalex-snapshot
χ -boundedness and related problems on graphs without long induced paths: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.007openalex-snapshot
Rooted minor problems in highly connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.043openalex-snapshot
On a new reformulation of Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.032openalex-snapshot
Hadwiger's conjecture for circular colorings of edge-weighted graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.019openalex-snapshot
On the Hadwiger's conjecture for graph products
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.017openalex-snapshot
The edge version of Hadwiger’s conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.009openalex-snapshot
Cliques, minors and apex graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.023openalex-snapshot
A basic elementary extension of the Duchet–Meyniel theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.022openalex-snapshot
Structure of 4-connected claw-free graphs not containing a subdivision of K5
inferred← citeshttps://doi.org/10.1016/j.disc.2011.07.003openalex-snapshot
Large minors in graphs with given independence number
inferred← citeshttps://doi.org/10.1016/j.disc.2015.07.015openalex-snapshot
Odd complete minors in even embeddings on surfaces
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.015openalex-snapshot
Bicircular matroids are 3-colorable
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.022openalex-snapshot
An introduction to the discharging method via graph coloring
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.001openalex-snapshot
Complete graph immersions in dense graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112095openalex-snapshot
On clique immersions in line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113319openalex-snapshot
Optimal connectivity for fat-triangle linkages
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113686openalex-snapshot
Oriented cobicircular matroids are GSP
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.01.011openalex-snapshot
On the structure of k-connected graphs without Kk-minor
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.02.010openalex-snapshot
Fractional coloring and the odd Hadwiger’s conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.07.024openalex-snapshot
Hadwiger’s conjecture for proper circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.05.015openalex-snapshot
Contractibility and the Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.06.001openalex-snapshot
On topological relaxations of chromatic conjectures
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.006openalex-snapshot
Beautiful conjectures in graph theory
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.05.003openalex-snapshot
Hadwiger’s Conjecture for inflations of 3-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.10.003openalex-snapshot
Hadwiger’s conjecture for squares of 2-trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.003openalex-snapshot
Forcing clique immersions through chromatic number
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103711openalex-snapshot
Properties of 8-contraction-critical graphs with no K7 minor
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.103971openalex-snapshot
Coloring hypergraphs with excluded minors
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104033openalex-snapshot
Hadwiger’s conjecture and topological bounds
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104042openalex-snapshot
Biclique immersions in graphs with independence number 2
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.045openalex-snapshot
Packing and covering with linear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.075openalex-snapshot
On Vertex Partitions and the Colin de Verdière Parameter
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.092openalex-snapshot
Finite duality for some minor closed classes
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.04.008openalex-snapshot
A note on the Hadwiger number of circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.04.006openalex-snapshot
The extremal function for K8- minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.008openalex-snapshot
The extremal function for K9 minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.10.001openalex-snapshot
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.04.004openalex-snapshot
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.08.003openalex-snapshot
Distance constraints in graph color extensions
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.11.002openalex-snapshot
A relaxed Hadwiger's Conjecture for list colorings
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.04.003openalex-snapshot
A special case of Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.03.006openalex-snapshot
On the odd-minor variant of Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.07.006openalex-snapshot
Linear connectivity forces large complete bipartite minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.12.001openalex-snapshot
Note on coloring graphs without odd- Kk -minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.05.002openalex-snapshot
Independent paths and K5 -subdivisions
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.04.005openalex-snapshot
Clique minors in claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.02.001openalex-snapshot
Connectivities for k -knitted graphs and for minimal counterexamples to Hadwigerʼs Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.07.005openalex-snapshot
Coloring immersion-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.001openalex-snapshot
Coloring graphs with forbidden minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.08.006openalex-snapshot
K6 minors in 6-connected graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.09.007openalex-snapshot
K6 minors in large 6-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.05.007openalex-snapshot
Maximal ambiguously k-colorable graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.003openalex-snapshot
Additive non-approximability of chromatic number in proper minor-closed classes
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.05.002openalex-snapshot
Rooted topological minors on four vertices
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.12.007openalex-snapshot
Linking four vertices in graphs of large connectivity
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.002openalex-snapshot
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.008openalex-snapshot
Clique immersion in graphs without a fixed bipartite graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.010openalex-snapshot
Immersion and clustered coloring
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.05.004openalex-snapshot
Local Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.08.005openalex-snapshot
Bipartite graphs with no K6 minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.08.009openalex-snapshot
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.02.001openalex-snapshot
Clustered coloring of (path + 2K1)-free graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.08.001openalex-snapshot
Clustered coloring of graphs excluding a subgraph and a minor
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00087-5openalex-snapshot
Matchings and Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/s0195-6698(03)00108-2openalex-snapshot
Some connectivity properties for excluded minors of the graph invariant ν(G)
inferred← citeshttps://doi.org/10.1017/cbo9780511721328.012openalex-snapshot
List colourings of graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781107325975.008openalex-snapshot
Counting planar graphs and related families of graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.008openalex-snapshot
New tools and results in graph minor structure theory
inferred← citeshttps://doi.org/10.1017/s0963548308009462openalex-snapshot
A Weakening of the Odd Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1017/s0963548309009717openalex-snapshot
Random Graphs from a Minor-Closed Class
inferred← citeshttps://doi.org/10.1017/s0963548311000174openalex-snapshot
Minors in Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1017/s0963548318000548openalex-snapshot
Improper colouring of graphs with no odd clique minor
inferred← citeshttps://doi.org/10.1017/s0963548321000390openalex-snapshot
Strong complete minors in digraphs
inferred← citeshttps://doi.org/10.1017/s0963548322000116openalex-snapshot
Improved lower bound for the list chromatic number of graphs with no K t minor
inferred← citeshttps://doi.org/10.1017/s0963548322000268openalex-snapshot
Improved bound for improper colourings of graphs with no odd clique minor
inferred← citeshttps://doi.org/10.1017/s0963548323000354openalex-snapshot
On the choosability of -minor-free graphs
inferred← citeshttps://doi.org/10.1023/a:1009784115916openalex-snapshot
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable
inferred← citeshttps://doi.org/10.1090/proc/16069openalex-snapshot
Independence number in triangle-free graphs avoiding a clique minor
inferred← citeshttps://doi.org/10.1090/suga/499openalex-snapshot
The Four Color Theorem and its aftermath
inferred← citeshttps://doi.org/10.1090/tran/9493openalex-snapshot
Limits of degeneracy for colouring graphs with forbidden minors
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.9.2301openalex-snapshot
New Graph Calculi for Planar Non-3-Colorable Graphs
inferred← citeshttps://doi.org/10.1093/imrn/rnab154openalex-snapshot
Extremal density for sparse minors and subdivisions
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00116openalex-snapshot
Proof of the Clustered Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567041openalex-snapshot
A graph minor perspective to network coding: Connecting algebraic coding with network topologies
inferred← citeshttps://doi.org/10.1109/sfcs.2005.14openalex-snapshot
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
inferred← citeshttps://doi.org/10.1109/tit.2014.2336836openalex-snapshot
A Graph Minor Perspective to Multicast Network Coding
inferred← citeshttps://doi.org/10.1112/jlms.12127openalex-snapshot
Improper colourings inspired by Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1137/070693540openalex-snapshot
$K_6$-Minors in Triangulations on the Klein Bottle
inferred← citeshttps://doi.org/10.1137/090766814openalex-snapshot
Complete Minors and Independence Number
inferred← citeshttps://doi.org/10.1137/100796649openalex-snapshot
Thomassen's Choosability Argument Revisited
inferred← citeshttps://doi.org/10.1137/141002177openalex-snapshot
A Relative of Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1137/16m1086236openalex-snapshot
Hadwiger's Conjecture for Graphs with Forbidden Holes
inferred← citeshttps://doi.org/10.1137/20m1335054openalex-snapshot
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
inferred← citeshttps://doi.org/10.1137/22m1522413openalex-snapshot
Refined List Version of Hadwiger’s Conjecture
inferred← citeshttps://doi.org/10.1137/23m157082xopenalex-snapshot
Chasing Tripods to Obtain a Rooted Subdivision
inferred← citeshttps://doi.org/10.1137/s0895480103421129openalex-snapshot
Graph Minors and Reliable Single Message Transmission
inferred← citeshttps://doi.org/10.1142/s0219265921500304openalex-snapshot
A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1142/s1793830909000026openalex-snapshot
THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO
inferred← citeshttps://doi.org/10.1142/s1793830910000759openalex-snapshot
PARTIAL RESULT ON HADWIGER'S CONJECTURE
inferred← citeshttps://doi.org/10.1145/1132516.1132576openalex-snapshot
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
inferred← citeshttps://doi.org/10.1145/1536414.1536476openalex-snapshot
Hadwiger's conjecture is decidable
inferred← citeshttps://doi.org/10.1145/1810959.1810975openalex-snapshot
Linkless and flat embeddings in 3-space and the unknot problem
inferred← citeshttps://doi.org/10.1145/1998196.1998256openalex-snapshot
Minors in random and expanding hypergraphs
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.11650/twjm/1500407298openalex-snapshot
CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS
inferred← citeshttps://doi.org/10.1365/s13291-022-00247-7openalex-snapshot
Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász
inferred← citeshttps://doi.org/10.14418/wes01.2.346openalex-snapshot
An Accounting of Colorings of Graphs
inferred← citeshttps://doi.org/10.14418/wes01.3.19openalex-snapshot
Chromatic Number and Immersions of Complete Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25775openalex-snapshot
From Width-Based Model Checking to Width-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.18297/etd/647openalex-snapshot
Planar graphs : a historical perspective.
inferred← citeshttps://doi.org/10.2140/involve.2020.13.829openalex-snapshot
Simple graphs of order 12 and minimum degree 6 contain K6 minors
inferred← citeshttps://doi.org/10.2436/bscm.v0i0.60046openalex-snapshot
El gran teorema de la combinatòria moderna
inferred← citeshttps://doi.org/10.26493/1855-3974.112.b74openalex-snapshot
Immersing small complete graphs
inferred← citeshttps://doi.org/10.3390/axioms12060556openalex-snapshot
Strong Edge Coloring of K4(t)-Minor Free Graphs
inferred← citeshttps://doi.org/10.3390/sym17101588openalex-snapshot
Hadwiger’s Conjecture for Dense Strongly Regular Graphs
showing the first 200 of 253 · page through all 253
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.