Pages that link to "Item:Q2460628"

The following pages link to Independent systems of representatives in weighted graphs (Q2460628):

Displaying 46 items.

• Star clusters in independence complexes of graphs (Q390992) (← links)
• On a lower bound for the connectivity of the independence complex of a graph (Q409373) (← links)
• Splittings of independence complexes and the powers of cycles (Q412186) (← links)
• Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
• On rainbow matchings in bipartite graphs (Q510529) (← links)
• Colorful paths for 3-chromatic graphs (Q512581) (← links)
• The circular chromatic index of graphs of high girth (Q858677) (← links)
• Independence complexes of chordal graphs (Q982628) (← links)
• Coloring by two-way independent sets (Q1044959) (← links)
• Independence-domination duality in weighted graphs (Q1637152) (← links)
• On a conjecture of Stein (Q1688259) (← links)
• Fair representation in dimatroids (Q1689871) (← links)
• A revival of the girth conjecture (Q1880788) (← links)
• Different versions of the nerve theorem and colourful simplices (Q2010622) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
• Distance \(r\)-domination number and \(r\)-independence complexes of graphs (Q2122691) (← links)
• Aspects of topological approaches for data science (Q2148960) (← links)
• The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
• Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
• A note on coloring vertex-transitive graphs (Q2341047) (← links)
• Cooperative colorings and independent systems of representatives (Q2346466) (← links)
• Independent transversals in locally sparse graphs (Q2384801) (← links)
• Topological methods for the existence of a rainbow matching (Q2413401) (← links)
• A note on interconnecting matchings in graphs (Q2509302) (← links)
• On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
• An average degree condition for independent transversals (Q2668023) (← links)
• A geometric Hall-type theorem (Q2789848) (← links)
• (Q3391328) (← links)
• The intersection of a matroid and a simplicial complex (Q3420348) (← links)
• Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
• Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← links)
• Fair Representation by Independent Sets (Q4604368) (← links)
• A Stability Theorem for Matchings in Tripartite 3-Graphs (Q4962591) (← links)
• Finding independent transversals efficiently (Q4987260) (← links)
• Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
• An asymptotic bound for the strong chromatic number (Q5222554) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
• Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
• Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
• Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
• Graphs of low average degree without independent transversals (Q6093156) (← links)
• Chordal graphs, higher independence and vertex decomposable complexes (Q6159132) (← links)
• On maximum bipartite matching with separation (Q6161448) (← links)
• Packing list‐colorings (Q6185050) (← links)